From ced2d8f8fcd47b1a1b2d2aad7b1c85dafe219346 Mon Sep 17 00:00:00 2001 From: shivam khatri Date: Tue, 13 Jun 2017 22:45:42 +0530 Subject: [PATCH] Create Bitmask-Dynamic-Programming.md Added dp state description --- Notes/Bitmask-Dynamic-Programming.md | 3 +++ 1 file changed, 3 insertions(+) diff --git a/Notes/Bitmask-Dynamic-Programming.md b/Notes/Bitmask-Dynamic-Programming.md index 9154497..ef938b3 100644 --- a/Notes/Bitmask-Dynamic-Programming.md +++ b/Notes/Bitmask-Dynamic-Programming.md @@ -71,6 +71,9 @@ public double solve( int bitmask, int pos ) } ``` +State of DP: +dp[ bitmask ][ pos ] = The Best cost to travel the un-masked cities , if the last visited city was 'pos'. + If we know that `solve( bitmask, pos )` will give us thge answer to the traveling salesman problem, and we say that we start at city 0, what should our initial function call be? What is the value of `bitmask`?