Description: With a backtracking depth-first strategy: to solve the classic problem solving Savage missionaries across the river: three monks and three Savage across the river, the ship only contained a maximum of two people, the number of monks at any time not less than the number of Savage Otherwise, Savage will eat monks. Smoothly across the river to find six people to all programs. Used with a backtracking depth-first search strategy, a total of seven kinds of legal action defined (2,0,0), (1,0,0), (1,1,0), (0,1,0), (0 , 2,0), (0,1,1), (1,0,1) represents the number of people on board, according to vessel location decision is plus or minus state operation. Extension junction point, application and operation in order to know back to the initial state and all the operations used up, the process has been completed.
To Search:
- [94-100] - C language section 93-100 100 cases of p
- [A_Star_M_C] - The use of A* algorithm to solve the pro
- [123] - 智力400题及逻辑测试题（笔试面试时经常会遇到的智力题）（附有答案）
- [frame] - By backtracking to solve is not very tro
File list (Check if you may need any files):
ai1.txt
Download