Unformatted text preview: -if its not a legal move, return false-if it is legal, make the move(asterisk) -see if it leads to a soltion-recursively try all possible “next” moves until-1 a solution is found-2 all moves are exhausted without a solution-in case of 2, this implies no solution from the current point, so. .-erase this move-return false...
View Full Document
- Spring '08
- The Current, Fibonacci number, sequence Int fib, iterative Int fib