Introduction - If you have any usage issues, please Google them yourself
Design Notes : 1. Data structure and said : 1,2,3,4 procedures used were said to the right, and left, The figure moved to the block among the blanks. A typical tree Chain structure, each have a situation BoardState category. For France order to avoid excessive copying the list was, in consideration of the tree structure to preserve the situation in relation to the succession. Each of the new situation after the election, have cited valuation function f value, in accordance with the size of its insertion Chain, in order to achieve the "priority start small f value of the node." Solve () function in the successful solution of the problem after a law to preserve sequence for output and return to zero. and failure to return to the failed node floors. (Specific judgment method, see be
Packet : 516224098数码a算法.rar filelist
8数码A算法\8p.cpp
8数码A算法\8p.dsp
8数码A算法\8p.dsw
8数码A算法\8p.h
8数码A算法\说明.doc
8数码A算法\8p.ncb
8数码A算法\Debug
8数码A算法\8p.plg
8数码A算法\8p.opt
8数码A算法