- Category:
- AI-NN-PR
- Tags:
-
[WORD]
- File Size:
- 10.14kb
- Update:
- 2008-10-13
- Downloads:
- 0 Times
- Uploaded by:
- kendydrm
Description: us solve eight digital, BFS may lead to insufficient memory, using heuristic search, heuristic function f (x) = g (x) h (x) g (x) for the target node is different from the number of nodes, h (x) for the nodes of depth, the choice between f (x) nodes that the smallest node expansion. the introduction of an "expanded array [4]" (because the expansion of the nodes at most four), The array maintains a node of 0:00 a.m. to expand in all directions in the target node, and then expanded array analysis, use heuristic function during recursive expansion ...
- [ Thread01] - multi thread program by java
- [problems.Rar] - eight digital vc realize the problem, be
- [eightdigital(AStaralgorithm).Rar] - with A* algorithm eight digital problem.
- [8num] - use Java to prepare the eight digital pr
- [hii] - this forum is a good inside BSS JSP is d
- [AIbashuma] - us solve eight digital, BFS may lead to
- [MYshizhong] - provide a younger procedures, a bit stup
- [xiangji] - I read a foreign friends on the cameras
- [BaShuMa2] - Using java to achieve artificial intelli
- [EightNumber] - This is the eight original digital proce
File list (Check if you may need any files):
Download