搜索资源列表
river
- 贪心算法作业的解题报告和源代码。问题描述：在深夜里，n 个人想要尽快地通过一条河。河上有一座狭小的桥，每次最多只能两个人一起过河。由于桥上的道路一片漆黑，他们必须用仅有一个手电筒，来照亮道路。已知 n 个人过河分别需要 t1,t2,…,tn 的时间，两个人一起过河所需要的时间是取决于速度较慢的人所需要的时间。请计算出 n 个人过河所需要的最小时间。-Greedy algorithm for solving the report and source code. Problem Descr ipt
fluss
- 用collocation方式对过河问题进行优化-collocation OPT
xds
- 数据结构的经典问题，修道士与野人过河 求解步骤 源码-Classic problem of data structure, monks and Savage solving steps across the river source
across-the-river
- cout< "有一个农夫带一只羊、一筐菜和一只狼过河. "<<endl cout<<"如果没有农夫看管，则狼要吃羊，羊要吃菜."<<endl cout<<"但是船很小，只够农夫带一样东西过河。"<<endl cout<<"问农夫该如何解此难题？"<<endl-cout < < " there is a farmer with a sheep, a wolf across
Savage_with_plans_to_cross_the_river_breadth_first
- 关于野人过河问题中的程序设计，包括用图的广度优先搜索算法-Across the river on the Savage program design issues, including breadth-first graph search algorithm
3
- 野人过河，这是一个古典问题，算法很经典，我看了好多遍，现在能闭着眼睛写出来了，-Savage river, this is a classical problem, the algorithm is very classic, I saw a lot of times, are now able to write out your eyes closed, He He
threeman
- 经典的三人过河问题，利用MATLAB求解，最后的出决策矩阵，由此安排过河方案！-The classic three-river issues, the use of MATLAB to solve, the last of a decision matrix, thereby arrange the program across the river!
ren
- 某人带狼、羊以及蔬菜渡河，一小船除需人划外，每次只能载一物过河。而人不在场时，狗要吃羊，羊要吃菜，问此人应如何过河？-A person with a wolf, sheep and vegetables to cross the river, a boat need not only draw people outside, each containing an object across the river only. And the person' s absence, the dog
game
- 各种小游戏--苹果游戏，17级台阶，安全过河问题，扫雷游戏-game
Farmer_River
- 农夫过河算法 问题描述： 1在有限的步数内，农夫要把狼、羊、菜都运过河 2每次只能带一样或不带，狼和羊，菜和羊无法在岸边共存 备注：在DEV下编译通过-Farmers across the river algorithm Problem Descr iption: in a limited number of steps, the farmers make the wolf, sheep, and vegetables were transported a
207
- 功能很强大，是用C语言编的一个商人过河游戏程序，适合于有一定C语言基础，想更进一层楼的C语言爱好者-Very powerful feature is the use of C language compiled a businessman across the river games, suitable for a certain C language based on C-like mode for even floor fans
207
- 商人过河游戏 :功能很强大，是用C语言编的一个商人过河游戏程序，适合于有一定C语言基础，想更进一层楼的C语言爱好者-Merchants to cross the river game: very powerful feature is the use of C language compiled a businessman to cross the river games, suitable for a certain C language based on C-like mode for e
yerenguohe
- 人工智能中经典算法野人过河的问题C语言实现-Classic algorithms in Artificial Intelligence Savage C language implementation issues across the river
passliver
- 过河问题求解算法,采用C语言实现，利用递归算法求解出最后可行的方案，而且人数是可变的。-the way to pass the liver
shangrenguohe
- 商人过河程序，找了好久才找到的程序-shangrenguohe
unit14_1
- 商人过河实验的mathematica程序应用动态规划算法-mathematica
tusousuo
- 状态图实际上是一类问题的抽象表示。事实上，有许多智力问题(如梵塔问题、旅行商问题、八皇后问题、农夫过河问题等)和实际问题（如路径规划、定理证明、演绎推理、机器人行动规划等）都可以归结为在某一状态图中寻找目标或路径的问题。因此，研究状态图搜索具有普遍意义。 -State diagram is actually a class of abstract representation of the problem. In fact, there are many mental problems (s
11
- 这是一个可以在vc环境下使用的c语言 其功能是实现了人工智能里传教士与野人过河的经典问题-This is an environment in vc using c-language whose function is to achieve artificial intelligence to cross the river where missionaries and savages a classic problem of
CrossingRiver
- 野人过河问题的实现，并有动画效果演示，用openGL做的-Savage realization of the problem across the river and have animation demo, to do with openGL
ai1
- 带回溯的深度优先策略：解决经典野人传教士过河问题的求解：三个修道士和三个野人过河，船一次最多只能载两个人，在任何时候修道士的人数不能少于野人人数，否则野人会吃掉修道士。找出六个人顺利过河的所有方案。 采用带回溯的深度优先搜索策略，共定义了7种合法操作{2,0,0},{1,0,0},{1,1,0},{0,1,0},{0,2,0},{0,1,1},{1,0,1}代表上船的人数，根据船所在位置决定在状态上是加或者减操作。扩展结点时按顺序应用操作，知道回溯到初始状态且所有操作用完，程序结束。-Wi