| Title |
User |
Message |
Date Posted |
| Re: can you say loss in 0 knight moves? |
dAedaL |
"If the pawn reaches the top row of the board the game ends immediately and the knight loses (a loss)." Consider if the pawn were one square away from the top row. Since the pawn moves first, it reac... |
Jan 22, 2009 - 1:36:18 am UTC |
| Re: how large can r and c be |
hansonw1 |
r, c |
Jan 20, 2009 - 7:50:37 pm UTC |
| Re: technique? |
hansonw1 |
Graph Theory is an "umbrella" term - most of the time you don't need to learn anything special to solve these problems. For this problem, you can use recursion, DP, math, BFS, DFS, whatever. Since it... |
Jan 05, 2009 - 9:11:50 pm UTC |
| Re: technique? |
bbi5291 |
You do need to use graph theory, it's just that some graph theory algorithms are also classified as DP. The archetypal example is the Floyd-Warshall all-pairs shortest path algorithm. |
Jan 05, 2009 - 3:17:08 pm UTC |
| technique? |
seyonv |
Can you do this problem using just DP or do you have to use graph theory as well? |
Jan 05, 2009 - 11:47:08 am UTC |
