Advanced search using Alpha-Beta pruning |
|
| Author |
ddddd19@rambler.ru, kruch@bigmir.net
National Taras Shevchenko University of Kyiv,Faculty of Cybernetics
|
| Abstract |
This paper presents a new algorithm of search of the best move in computer games like chess, the estimation of its complexity is obtained.
|
| Keywords |
Alpha-Beta pruning, best move, complexity
|
| DOI |
doi:10.30970/ms.25.1.108-112
|
Reference |
1. Knuth D.E., Moore R.W. An analysis of Alpha-Beta pruning, Artificial Intelligence, 6 (1975), 293--326.
2. Marsland T.A. Computer chess and search, Encyclopedia of Artificial Intelligence, 1992. 3. Kendall G., Whitwell G. An evolutionary approach for the tuning of a chess evaluation function using population dynamics, Proceedings of the 2001 IEEE Congress on Evolutionary Computation, Seoul, Korea, May 27-30, 2001, 995--1002. 4. Moriaty D.E., Shultz A.C. , Grefenstette J.J. Evolutionary algorithms for reinforcement learning, Journal of Artificial Inteligence Research, 11 (1999), 241--276. 5. Thrun S. Learning to play the game of chess, In Tesauro G. , Touretzky D., Leen T., editors, Advances in neural information processing systems 7, San Fransisko, Morgan Kaufmann, 1995. 6. Битман А. Игра, похожая на жизнь, Компьютерра, 2003. |
| Pages |
108-112
|
| Volume |
25
|
| Issue |
1
|
| Year |
2006
|
| Journal |
Matematychni Studii
|
| Full text of paper | |
| Table of content of issue |