搜索资源列表
JAVA-Eight-digital-problem
- 九宫排字问题（又称八数码问题）是人工智能当中有名的难题之一。问题是在 3×3 方格盘上，放有八个数码，剩下第九个为空，每一空格其上下左右的数码可移至空格。问题给定初始位置和目标位置，要求通过一系列的数码移动，将初始位置转化为目标位置。本文介绍用普通搜索方法、双向广度搜索和启发式搜索如何缩短寻找路径的时间，以及各算法间的利与弊。-Jiugong typesetting problem (also known as eight digital problem) is one of famous pr
bashumashiyanbaogao
- 一份实验报告，上面有用启发函数求解的九宫格问题的源代码，可以直接运行-A test report, heuristic function useful for solving the above problem Jiugongge source code can be directly run
chess
- c语言,用A*算法求取重排九宫图问题 ，还有相关介绍-c language, with A* algorithm to strike a rearrangement JiuGongTu graph problems, as well as related presentations
eight-number-question
- 使用Java编写的用深度优先算法解决8数码问题的源码，八数码也叫九宫格问题，在使用算法前使用逆序数判断，自己写的，直接可以运行-Written in Java using depth-first algorithm source code, to solve the problem of 8 digital 8 digital also called scratchable latex, judge before using algorithm using reverse number, wri
nine
- 用C编写的人工智能程序。实现了九宫格问题启发式搜索。-AI programs written in C. Realized Jiugongge problem heuristic search.
ArtificialIntelligence
- 一些人工智能方面的学习源码，用java写的。包括遗传算法 alpha-beta剪枝 模拟退火算法 九宫格 传教士与野人等问题或者算法实现源码。-Some artificial intelligence to learn the source code, written in java. Including genetic algorithm alpha-beta pruning simulated annealing algorithm and other missionaries and Sa
ArtificialIntelligenceProject
- 有界深度优先搜索 广度优先搜索 等策略实现九宫格 八数码问题的智能搜索-Bounded depth-first search strategy to achieve breadth-first search and other squares eight digital intelligent search