Eight_Num_Fengart

代码说明：

  本代码是为了应付人工智能的实验而编写的，写的潦草请不要介意。我又是通过这代码来“引玉”，相信看过我编写的黑白棋源代码的人应该知道“引玉”是什么意思。如果你有“玉”（什么更高效的算法能在更短的时间内求得结果，或者博弈方面的），就欢迎“砸”过来[e-mail]，我会很感激！（A* 算法解决八数码问题我已经研究过了，不要砸这个来）在 赛扬D2.1G 的机器上测试，算法的解答时间不超过0.1秒。 最好优先搜索算法的解答时间一般在0.05秒左右。 里面还可以演示八数码问题的从初始态到目标状态的过程。 (the code is intended to meet the artificial intelligence experiments prepared, the notoriously difficult to write please do not mind. I pass this code is to "take the jade" I believe I read prepared reversi source code, should know "primer" jade what it meant. If you have "Jade" (what more efficient algorithm in a short time of use, or the Game) welcomed "crushed" them-- fengart @ 126.com, I would be very grateful! (A* algorithm to solve the problem eight digital I have examined, not to drop it on this) Celeron D2.1G machines to test, the algorithm is not the time to answer more than 0.1 seconds. Best first search algorithm to answer in time normally around 0.05 seconds. Which can also display eight digital issues from the initial state to target s)