Description: missionaries and Savage is a classic AI problem. The program uses a recursive algorithm. Definition of a function, the function returns a solution path, the road rules sequences can be used, said the state can also use the sequence indicated. For example, the sequence with rules that can be expressed as : (1) (1 0). . . Said : In the past, a missionary, a Savage, a return missionaries. . . If the state sequence that can be expressed as : (3 3 1) (2 2 0) (3). . . Path with a linked list, the function returns the List. In a call to the main function, and print output of the path.
To Search:
File list (Check if you may need any files):
Download