搜索资源列表
Ex01
- 传教士野人问题，使用暴力搜索法进行解答，可计算任意N和k-Savage missionary problem, the use of violence to answer the search method can calculate an arbitrary N and k
overrive
- 人工智能代码，野人过河求解-AI code, cross the river to solve .......................... Savage
CrossRiver
- 野人与传教士过河问题的实现！！！供学习实践用-Savage realized the problem with missionaries across the river! ! ! Used for the study and practice! ! !
god
- 传教士与野人问题(MC问题)的优化广搜 数量不限制-Missionaries and the Savage issue (MC issues) does not limit the number of optimized wide search
Backtrack_M_C
- 用回溯方法解决传教士野人问题。程序仅包含一个c源码文件，有详细注释-Solution to the missionaries with savage back problems. Program contains only one c source file, with detailed notes
missionaryandsavage
- 用C++实现人工智能中的传教士与野人过河问题，其于A*算法实现。-C++ implementation with the missionaries and the artificial intelligence problem of Savage river, which at the A* algorithm.
missionaryandsavage
- missionary and savage基于A*算法实现传教士与野人过河问题，用C语言实现的原代码。-missionary and savage A* algorithm-based missionaries and savages across the river problem, the original language with C code.
BarbAttackUI
- 模拟一个出游的国王护卫队，在野外遇到了野人攻击，在营地里设立防御后抵御四面野人的攻击，游戏就是通过输入命令调整四面防守人员的调度已达到防止野人伤害到国王的目的。指令输入形式如下<soldier type><from><to><number of men>，士兵有三种：剑士、弓箭手、国王卫士，分别缩写为s a k，指令aew10就代表把10个弓箭手从东面移到西面。野人出现方向随机，数量随机，总量固定，野人死光算赢，国王死或有10个野人进入到营地中间算
jiaoshi
- 人工智能中著名的传教士与野人问题的c语言实现，运用领结表实现-Missionaries and the famous artificial intelligence problem Savage c language, the use of tie table implementation
BarbAttack
- 一个野蛮人进攻国王以及护卫的游戏。 游戏有剑手，弓手，守卫三种士兵-A savage attack on the king and the security of the game. Games swordsman, archers, three soldiers guarding
chuanjiaoshi
- 有N个传教士和N个野人要过河，现在有一条船只能承载K个人（包括野人），K<N，在任何时刻，如果有野人和传教士在一起，必须要求传教士的人数多于或等于野人的人数。-N and N have a savage missionary to cross the river, there is now a boat can only hold K individuals (including Savage), K <N，在任何时刻，如果有野人和传教士在一起，必须要求传教士的人数多于或等于野人的人
CorssRiver
- 有N个传教士和N个野人要过河，现在有一条船只能承载K个人（包括野人），K<N，在任何时刻，如果有野人和传教士在一起，必须要求传教士的人数多于或等于野人的人数。 用A*算法实现。-N and N have a savage missionary to cross the river, there is now a boat can only hold K individuals (including Savage), K <N，在任何时刻，如果有野人和传教士在一起，必须要求传教士的
man-crazy
- 经典的野人过河问题。java代码，非常具有参考价值，下载可以直接运行-Savage river classic problem. java code, very valuable, can be downloaded directly run
2
- C++面向对象程序设计（第6版） （美）萨维奇 著，周靖 译-C++ object-oriented programming (6th Edition) (U.S.) Savage a, ZHOU Jing Translation
AI
- 人工智能,野人与传教士c语言程序。在vc6.0环境中能够正常运行。-Artificial intelligence, savage and missionaries c language program. In vc6.0 environment to normal operation.
include
- 经典的野人与传教士渡河问题代码 ，解决了状态搜索问题。-Savage and missionaries crossing the classic problem of the code, solve the state search problem.
11
- 传教士与野人过河的程序代码，程序决定正确-Savage missionaries across the river with the code, the program the right decision! ! ! ! ! ! ! ! !
TSP-8grid
- 人工智能实验，基于遗传算法TSP 八数码 解决传教士—野人问题的递归程序 等问题-Artificial intelligence experiments, based on genetic algorithm to solve TSP eight digital missionaries- Savage problem issues such as recursive program
monk_savage2
- n位野人和n位传道师 渡河问题 确保传道士安全的解决方案 -Savage And Register AcrossTheRiver
MC
- MC(传教士-野人）问题，VS2008编译通过，输入格式为MC.exe 输入文件名 输出文件名，输入文件中为传教士（野人）数n和船容量k，输出文件为路径-MC (Missionaries- Savage) problem, VS2008 compiler, enter the name of the input file format MC.exe output file name, input file for the missionaries (Savage) n and boat capa