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.

传教士与野人问题
................\1_Savage.exe
................\Readme.txt
................\Savage.cpp

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．