搜索资源列表
a
- Prolog实现农夫、狼、羊、白菜问题,短你没啊,什么破网站-you guess
passriver
- 农夫过河程序。农夫载狼、羊、菜过一条河,每次只允许农夫和其中最多一样过河。若无农夫看管,狼若和羊在一起时,狼会吃掉羊;若羊和菜一起时,羊会吃掉菜。使农夫、狼羊和菜安全到达河的对岸。-The farmer across the river program. Farmer set the wolf, sheep, vegetables across a river, each of which allows only up to the f
guohe
- 农夫过河问题也一直是一个比较经典的问题,本程序能够正确给出农夫如何过河的抉择过程以及解决方法。-The farmer has always been a problem across the river more classic issues, this program shows farmers how to cross the river to the correct choice of process and solution.
cross-river
- 过河问题,农夫带狼、羊、白菜在一定条件下过河-Crossing problem, the farmer with the wolf, sheep, and cabbage across the river, under certain conditions
Text1
- 数据结构学习中的农夫过河问题: 有一人要将自己的兔子、蔬菜、狐狸三物品运过河,但过河的船每次只能运农夫自己和一样东西,而这三种物品之间有存在一定的制约关系:兔子不能单独和狐狸或蔬菜放在一起。构造出问题模型并编程实现求解。-Data structure learning problem in the farmer across the river: one person to own a rabbit, vegetables, fox a
nfgh
- 人工智能课作业 农夫过河问题的PRO代码 对你有帮助-AI Homework problems crossing the farmer PRO code to help you
Russian-farmer-algorithm
- 俄国农夫算法 俄式乘法,又被称为俄国农夫法,它是对两个正整数相乘的非主流算法。假设m和n是两个正整数,我们要计算它们的积。-Russia Russian farmer multiplication algorithm, also known as the Russian farmer method, it is multiplying two positive integers non-mainstream algorithms. Su
The-farmer-across-the-river
- 一个农夫带着—只狼、一只羊和—棵白菜,身处河的南岸。他要把这些东西全部运到北岸。他面前只有一条小船,船只能容下他和—件物品,另外只有农夫才能撑船。如果农夫在场,则狼不能吃羊,羊不能吃白菜,否则狼会吃羊,羊会吃白菜,所以农夫不能留下羊和白菜自己离开,也不能留下狼和羊自己离开,而狼不吃白菜。请求出农夫将所有的东西运过河的方案。-A farmer with- wolves, a sheep and- cabbage, living in th
nongfuguohe
- 农夫过河,用c++编程,对初学者有很大帮助。-Farmer across the river, with c++ programming, very helpful for beginners.
Russian-farmer-multiplication
- 俄罗斯农夫算法,算法分析期末作业,作业要求不使用乘除法-Russian farmer algorithm does not use multiplication and division
farmer
- 农夫过河 (宽度优先搜索实现) 算法算计与分析-wide search first
Crossing-the-river-problem
- 本程序采用广度优先搜索算法求解农夫过河问题-This program uses a breadth-first search algorithm for the farmer across the river
duhewenti
- 农夫带着狼、羊、青菜过河。 渡河问题 农夫不在时,狼会吃羊且羊会吃青菜。 每次摆渡农夫只能带一样东西。 编程显示过河方法,要求摆渡次数最少。 -农夫带着狼、羊、青菜过河。 农夫不在时,狼会吃羊且羊会吃青菜。 每次摆渡农夫只能带一样东西。 编程显示过河方法,要求摆渡次数最少。
duilie
- 使用队列的建队列,入队列和出队列的方法实现农夫过河的问题-The farmer across the river to use the build queue of the queue into the queue and the queue
FRAMER
- 一个农夫带着一只羊,一条狼和一颗白菜想从河的东岸到西岸去。河上仅有一条船。只有农夫一人会开船。假设他每次只能带一只羊,或者一条狼,或者一颗白菜过河,并且当人不在场时,狼和羊,或羊和白菜不能单独在一起,因为狼会吃羊,羊会吃白菜。试编写程序求出他带一只羊,一条狼和一颗白菜过河的所有办法。-A farmer with a sheep, a wolf and a cabbage would like to go from the eastern
AccrossTheRiver
- 农夫过河问题,有狼,羊,菜三种,选择安全过河方式。-The farmer across the river, there are wolves, sheep, vegetables three, select safe to cross the river way.
the-farmer-across-the-river-
- 这是实现“农夫过河”益智题的c语言的算法或数据结构-This is the farmer across the river " puzzle questions of c language algorithms or data structures
overfencing
- USACooverfencing 题解,描述 农夫John在外面的田野上搭建了一个巨大的用栅栏围成的迷宫。幸运的是,他在迷宫的边界上留出了两段栅栏作为迷宫的出口。更幸运的是,他所建造的迷宫是一个“完美的”迷宫:即你能从迷宫中的任意一点找到一条走出迷宫的路。给定迷宫的宽度W(1<=W<=38)及高度H(1<=H<=100)。 2*H+1行,每行2*W+1的字符以下面给出的格式表示一个迷宫。然后计算从迷宫中最“糟糕”
CrossRiver
- c语言编写的农夫过河问题,合适初学者学习和使用-C language farmer across the river, suitable for beginners to learn and use
The-farmer-orchard-system
- UML实验农夫果园系统,通过Java语言来实现-Gaden of the gadener