搜索资源列表
SP1923106
- 专家系统课程设计,用计算机解决SP先生谜题,有详细代码-curriculum design expert system, computer SP Mr. Mystery solved a detailed code
Fish
- 爱因斯坦谜题，谁养鱼（环境：VisualStdio 2005）-Mystery of Einstein, who fish (Environment : VisualStdio 2005)
hoa
- S先生与P先生谜题 设有两个自然数X、Y，2<=X<=Y<=99,S先生知道这两个数的和S，P先生知道这两个数的积P，他们二人进行了如下对话： S：我确信你不知道这两个数是什么，但我也不知道。 P: 一听你说这句话，我就知道这两个数是什么了。 S: 我也是，现在我也知道了。-Mr. S and P with Mr. Mystery of two natural X, Y, 2
penguzzle
- 著名的15谜游戏（15-puzzle ）的Tcl/Tk版本，现在它可以有 4x4, 5x5 或6x6 的格子，所以更加有趣，改变图片也更加容易。 -mystery of the famous 15 games (15-puzzle) Tcl / Tk editions, it could 4x4, 5x5 or 6x6 lattice, the more interesting and change the picture much easier.
source3
- 以一个案例说明逻辑问题及其解法: 某地刑侦大队对涉及6个嫌疑人的一桩疑案进行分析-Case is an illustration of a logic problem and its solution: a place in the Criminal Investigation Brigade of the six suspects involved in the analysis of a mystery
secret_of_data
- 介绍了编码的奥秘，对学习编码的人很是实用-Introduced a code of mystery, people are learning is practical coding
Mysteryproblem
- 重排九宫是一个古老的单人智力游戏。据说重排九宫起源于我国古时由三国演义故事“关羽义释曹操”而设计的智力玩具“华容道”，后来流传到欧洲，将人物变成 数字。原始的重排九宫问题是这样的：将数字1～8按照任意次序排在3×3的方格阵列中，留下一个空格。与空格相邻的数字，允许从上，下，左，右方向移动到 空格中。游戏的最终目标是通过合法移动，将数字 1～8 按行排好序。在一般情况下，n2-1 谜问题是将数字 1～n2-1 按照任意次序排在n×n的方格阵列中，留下一个空格。允许与空格相邻的数字从上，下，左，右
Maze
- 用一个具体的二维数组（其元素只含0 1，其中0表示路，1表示墙）抽象成一个迷宫，探谜者从迷宫唯一的一个入口进入迷宫，找出一条通路从唯一的一个出口走出来。-With a specific two-dimensional array (whose elements contain only 01, where 0 means Road, 1 wall) abstracted into a maze, who Exploring the Mystery of the only one from th
A_very_sim977756232002-457852ngfppr2567
- A very simple example of Neural Networks using back propagation This program is a simple example of Neural Networks using back propagation. My code has all basic functionalities like learning rate, load net, save net, etc. You can have as many layer
Astar
- 经典的智能寻路算法，一个老外写的很透彻很清晰，很容易让人理解神秘的A*算法。-Classic intelligent pathfinding algorithm, written by a foreigner is very thorough very clear and easy to understand the mystery of the A* algorithm.
gongjiaoche
- 公交车之谜：从学校到人民公园共有n(1<=n<=20)站路，小明刚上车时车上有m个人，每到一站都有pi个人上车，qi个人下车，问这一路上公车上最多有多少人。(0<=m, pi ,qi <=50). -Mystery Bus: People s Park from the school to a total of n (1 <= n <= 20) Station Road, Xiao Ming on the car the car just has m indi
AdditionMystere
- Solve mystery sums (like SEND+MORE=MONEY)