搜索资源列表
6
- 人携带狐狸，鹅，豆子安全过河问题，应用各种不同算法，SWI-prolog编程，简单游戏-Person carrying a fox, geese, beans safety problem across the river, the application of different algorithms, SWI-prolog programming, easy Games
farmer
- 农夫过河 （宽度优先搜索实现） 算法算计与分析-wide search first
207
- 一个模拟商人过河的游戏，游戏简单，不过学习价值大-a game
Fama
- 2. 农夫和小米问题：农夫、狐狸、鸡和米都在一条河的左岸，现在要把它们全部送到右岸去，农夫有一条船，过河时，除农夫外，船上至多能载狐狸、鸡和米中的一样。狐狸要吃鸡，鸡要吃米，除非农夫在那里。试编程求出所有能确保全部安全的过河的计划，并给出Visual Prolog程序。-2. Farmer and millet issues: the farmer, the fox, chicken and rice are in a river' s left bank, and now all of
ws
- 这是一个用C#编的食人魔过河问题的程序代码。-This is a compiled using C# code problem across the river ogre.
ok
- 一个过河游戏的简单例子，描述：将猫和狗还有老鼠运送到河对岸，要求，一次只能携带一只动物，且猫和老鼠不能共存，猫和狗也不能共存。使用最少的步骤完成-A simple example of the game across the river to describe: The cats and dogs are transported to the side of the river rats, the requirements can only carry one animal, and Tom a
MCO
- 在数据结构的基础上，用C++语言实现传教士与野人过河问题。-Based on the structure in the data, using C++ language implementation issues across the river missionaries and savages.
PriestsAndDevils
- 传教士与野人过河问题：三个牧师（也有的翻译为传教士）和三个野人过河，只有一条能装下两个人的船，在河的任何一方或者船上，如果野人的人数大于牧师的人数，那么牧师就会有危险. 找出一种安全的渡河方法-Priests And Devils
river
- 关于 农夫与羊的过河问题的求解算法，这是一个关于算法的问题，运用的数据结构与算法都是十分经典的 是非常值得借鉴的。-On the farmer and the sheep across the river problem solving algorithm, this is a problem on the algorithm, using the data structure and algorithm are very classic is worthy of consideration.
testconsole
- 关于数据结构的各章节的c原代码实现，还包括4主人4仆人过河等问题的求解等（全部经过上机验证过）-On the data structure c of all sections of the original code, but also including 4 masters 4 servant to solve such issues across the river, etc. (all through the machine verified)
foxRivVeg
- 类似早期农夫过河的问题 实现状态转换 保证兔子和蔬菜的存活-The farmer across the river similar to the problem of the early realization of state transitions to ensure the survival of rabbit and vegetables
yeren
- 野人过河问题,可能有点问题,但基本思想是对的,大家再查一下-Savage across the river issues, may be a bit problem, but the basic idea is correct, we re-check
shirenmoguohewenti
- 食人魔过河问题 源码 其中包括构造树 等算法问题 有研究算法的朋友可以参考-Ogre source across the river issues including the issue of structural tree algorithm, such as research algorithm can refer to a friend
src
- 商人过河问题是数学建模中的一个经典问题，程序利用链表存储渡河状态，使用穷举的算法实现。该算法会找出N个商人/随从渡河的一个可行方案，但并不保证是最佳方案。写完这个程序后让我想到的居然是图的深度优先搜索，二者在查找的思想上是类似的。-Merchants across the river mathematical modeling problem is a classic problem, the use of list storage procedures to cross the river,
Boanergesandsavage
- 同学做的野人与传教士过河问题的程序 三个野人三个传教士 每次最多过两个人-Savage classmates to do with the issue of missionaries across the river three procedures Savage had a maximum of three missionaries, two people
MissionaryPassRiver
- 原创，野人过河智力题面向对象解法！有三个传教士和三个野人一起过河，要求在河的任一边传教士的数目一定要大于野人的数目，否则野人就会吃掉传教士！可以到网上搜索flash游戏（野人过河）去玩！-Original, wild man of intelligence across the river title Object-Oriented Solution! There are three missionaries and three wild man to cross the river toget
river
- 三个强盗和三个商人过河的算法，简单的入门级别算法。适合刚接触算法初级编程人员。-Three bandits and three businessmen across the river of the algorithm, a simple entry-level algorithm.刚接触algorithm suitable for junior programmers.
shangrenguohe
- C语言编写的《 商人过河游戏》带注释 在 win tc 下运行通过。-C language businessmen across the river game with notes in the win tc run through.
c++
- 一、过河问题 二、南极冰山问题 传说中，南极有一片广阔的冰原，在冰原下藏有史前文明的遗址。整个冰原被横竖划分成了很多个大小相等的方格。在这个冰原上有N个大小不等的矩形冰山，这些巨大的冰山有着和南极一样古老的历史，每个矩形冰山至少占据一个方格，且其必定完整地占据方格。冰山和冰山之间不会重叠，也不会有边或点相连。 ACM探险队在经过多年准备之后决定在这个冰原上寻找遗址。根据他们掌握的资料，在这个冰原上一个大小为一格的深洞中，藏有一个由史前人类制作的开关。而唯一可以打开
River
- 过河问题，能够模拟多人过河的所有情况，给出遍历路径-Issues across the river, cross the river more than capable of simulating all the circumstances, given the path traversal