The question is, given an n x n checker board, and a cost function, fund the maximum value to move the checker from the bottom row to the top row. only stipulation is when you move up, you can only go to the square above you or diagnal (sp) left or right.

the cost function will basically return the cost and the inputs will be ur current row and col and the next row and col.

obviously, im not asking for the answer, but i am asking for help on where to start.

thanks