首页| JavaScript| HTML/CSS| Matlab| PHP| Python| Java| C/C++/VC++| C#| ASP| 其他|
购买积分 购买会员 激活码充值

您现在的位置是:虫虫源码 > 其他 > 在奥赛罗Delphi实现的博弈树搜索算法(黑白棋)游戏

在奥赛罗Delphi实现的博弈树搜索算法(黑白棋)游戏

资 源 简 介

This is the Othello program I developed in the 11th form in 2005. It uses negamax search algorithm with alpha-beta pruning optimization. It is able to search at the depth of up to 8 plies in a reasonable time in the midgame and up to 15 plies in the endgame.
VIP VIP
0.171272s