Location:
Search - EIGHTPUZZLE
Search list
Description: A*算法属于一种启发式搜索,它扩展结点的次序类似于广度优先搜索,但不同的是每生成一个子结点需要计算估价函数F,以估算起始结点的约束经过该结点至达目标结点的最佳路径代价 每当扩展结点时,意是在所有待扩展结点中选择具有最小F值的结点做为扩展对象,以便使搜索尽量沿最有希望的方向进行.A*算法只要求产生问题的全部状态空间的部分结点及关系,就可以求解问题了,搜索效率较高
Platform: |
Size: 47608 |
Author: 黄 |
Hits:
Description: 利用深度遍历的方法来检查8数码问题是否有解。-use depth traverse method to check whether the eight digital solutions to the problem.
Platform: |
Size: 2326 |
Author: 韩希先 |
Hits:
Description: 利用深度遍历的方法来检查8数码问题是否有解。-use depth traverse method to check whether the eight digital solutions to the problem.
Platform: |
Size: 2048 |
Author: 韩希先 |
Hits:
Description: A*算法属于一种启发式搜索,它扩展结点的次序类似于广度优先搜索,但不同的是每生成一个子结点需要计算估价函数F,以估算起始结点的约束经过该结点至达目标结点的最佳路径代价 每当扩展结点时,意是在所有待扩展结点中选择具有最小F值的结点做为扩展对象,以便使搜索尽量沿最有希望的方向进行.A*算法只要求产生问题的全部状态空间的部分结点及关系,就可以求解问题了,搜索效率较高-A* algorithm is a heuristic search, which extended the order of nodes is similar to breadth-first search, but the difference is that each node generates a subset of calculated cost function F, to estimate the initial bound node through the node to reach the target node the best path when the cost of the expansion of nodes, the intention is to be extended in all nodes in the selection of the smallest F value for the expansion of the target node in order to make the search as far as possible along the most promising direction . A* algorithm only requires a problem all part of the state space and the relationship between nodes, we can solve the problem, the search more efficient
Platform: |
Size: 1201152 |
Author: 黄 |
Hits:
Description: 用java编写的八数码算法，具有图形化界面和最优路径的输出-Using java prepared eight digital algorithm, with a graphical interface and the optimal path of output
Platform: |
Size: 3072 |
Author: fantasysq |
Hits:
Description: Solve the 8-puzzle problem using A * algorithme.
Input: Program reads start state and goal state and heuristic (N or S) from EightPuzzle.INP file.0 representing blank.
There are 2 Heuristic:
1. N: Number of misplaced tiles
2. S: Sum of Manhattan distance of current location and target location.
Format: The first line write type of heuristic (N or S).
Next is the status of departing and landing status. Between 2 states of 1 line blank.
See examples EightPuzzle.INP-Solve the 8-puzzle problem using A* algorithme.
Input: Program reads start state and goal state and heuristic (N or S) from EightPuzzle.INP file.0 representing blank.
There are 2 Heuristic:
1. N: Number of misplaced tiles
2. S: Sum of Manhattan distance of current location and target location.
Format: The first line write type of heuristic (N or S).
Next is the status of departing and landing status. Between 2 states of 1 line blank.
See examples EightPuzzle.INP
Platform: |
Size: 2048 |
Author: Duc Dung |
Hits:
Description: 使用了A*算法，双广度和带启发的双广度实现八数码问题求解。-Eight Puzzle
Platform: |
Size: 1454080 |
Author: willnow |
Hits:
Description: 八数码问题的c++源码，visual studio2005下编写，实现界面化，并提供了图形化演示过程。-8 digital issues of c++ source code, visual studio2005 prepared, of the realization of the interface and provide a graphical demonstration.
Platform: |
Size: 9602048 |
Author: lining |
Hits:
Description: 八数码问题，利用A*算法求解八数码问题，其中h函数为不在位将牌数-8 digital issues, the use of A* algorithm to solve 8 digital issues, including h function is the number of licenses is not in place to
Platform: |
Size: 3072 |
Author: jiangyuan |
Hits:
Description: A*算法实现八数码问题的解决，清华的人工智能课的作业，相信对后面的人有用。-A* Algorithm 8 digital solution to the problem, Tsinghua AI homework assignment, I believe that right behind him useful.
Platform: |
Size: 4096 |
Author: wqs07 |
Hits:
Description: eight puzzle using RBFS and A* search and manhattan distance heuristic function
Platform: |
Size: 19456 |
Author: sam |
Hits:
Description: 程序实现的是用A*算法求解八数码问题，初始状态和目标状态均可在源码中自行设置，程序运行后会得到从初始状态到目标状态的最佳解的逆序显示，文件help.txt中提供了程序的算法，程序的具体设计在源码中都有相应的注释-Program implementation is to use A* algorithm to solve 8 digital issues, the initial state and target state can be set up in the source code of its own, the program will be running from the initial state to target state of the optimal solution of the reverse display, file help. txt algorithm provided in the program, the program' s specific design in the source code has a corresponding note in
Platform: |
Size: 165888 |
Author: fuyaozong |
Hits:
Description: 八数码问题的实现算法，算法输入为包含初始状态的字符串，输出为移动的步骤-8 digital issues algorithm, the algorithm input contains the initial state of the string, the output for the mobile steps
Platform: |
Size: 4096 |
Author: lss |
Hits:
Description: 是采用MFC编写的让其自动实现eightpuzzle的功能-Is written using MFC functions let automatically eightpuzzle
Platform: |
Size: 77824 |
Author: 一剑清平 |
Hits:
Description: Java实现八数码求解问题。输入一串字符数组代表八数码的初始位置，最后得到正确的八数码排布-Java Implementation eight digital solve this problem. Enter a character array of eight digital representative of the initial position, and finally get the correct arrangement of the eight digital
Platform: |
Size: 2048 |
Author: 朱昌磊 |
Hits:
Description: 8 puzzle problem with A-star algorithm.-8 puzzle problem with A-star algorithm.
Platform: |
Size: 15360 |
Author: Jim |
Hits:
Description: BFS for EightPuzzle problem. Project done in NetBeans
Platform: |
Size: 211968 |
Author: Valik Smilenko |
Hits:
Description: 实现八数码功能 用的是广度优先算法 本实验旨在熟悉人工智能的搜索原理，会用无信息的搜索策略和有信息的搜索策略，实验选择广度优先、深度优先和A*算法实现八数码问题。-Realization of Eightpuzzle
Platform: |
Size: 5273600 |
Author: 张默 |
Hits:
Description: Code of game EightPuzzle.
Platform: |
Size: 3072 |
Author: Stefan |
Hits:
Description: 八数码 深度优先搜索 广度优先搜索 图搜索策略(eightpuzzle
Eight digital depth first search, breadth first search graph search strategy)
Platform: |
Size: 48128 |
Author: 妲己秘境 |
Hits: