黑白棋子的算法程序实现详细步骤及实现过程-reversi son algorithm program and detailed steps for achieving 下载
|
整体来说，这份代码是能够实现了黑白棋的智能下棋功能，而且也不弱，我想在国内应该找不到.NET版、而且高智能的黑白棋源代码了。 本来没打算发源代码，吝啬？主要我怕部分“懒人”修改本程序的界面，然后作为自己的东东去发布，还美其名曰“原创”（汗！），我想你不会是这样的人。 发源代码的目的是抛砖引玉（小弟我抛砖，有玉的尽量砸过来）。AI算法是通用的，并不局限于某种棋，你可以取其精华去其糟粕，少走很多不必要的弯路。 源码也方便了那些一心只想搞算法而不想花心思在界面上的朋友。 -overall, this code is to achieve a smart player reversi functional, but not weak, I would like to be unable to find domestic.NET version, but high intelligence reversi the source code. Originally did not intend to originate code, mean? I fear that the main part of "lazy" to modify this procedure interface, and then as their Eastern to publish, also the name of the "original" (Khan!) , I think you will not be that kind of person. Birthplace of the code is to encourage the (younger I parabolic brick, as the smash-up). AI algorithms is a common, is not confined to a game, you can select the essence to its dross and go to a lot of unnecessary detours. FOSS is also convenient for those who would like to engage wholeheartedly algorithm does not want the effort to interface f 下载
|
这个是一个简单但界面相当美观的人机对战五子棋系统，适合与初学者参考和借鉴,是学习Visual C++编程的绝好例子提供了五子棋对战的单人模式和双人模式。单人模式下运用人工智能的算法，进行人机对弈。同时提供双人模式，鼠标左键下白棋，右键黑棋。- 下载
|
本代码是为了应付人工智能的实验而编写的，写的潦草请不要介意。我又是通过这代码来“引玉”，相信看过我编写的黑白棋源代码的人应该知道“引玉”是什么意思。如果你有“玉”（什么更高效的算法能在更短的时间内求得结果，或者博弈方面的），就欢迎“砸”过来－－fengart@126.com，我会很感激！（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 下载
|