A New Action-Based Reasoning Approach for Playing Chess
Source abstract
Abstract
Many previous research studies have demonstrated game strategies enabling virtual players to play and take actions mimicking humans. The Case-Based Reasoning (CBR) strategy tries to simulate human thinking regarding solving problems based on constructed knowledge. This paper suggests a new Action-Based Reasoning (ABR) strategy for a chess engine. This strategy mimics human experts’ approaches when playing chess, with the help of the CBR phases. This proposed engine consists of the following processes. Firstly, an action library compiled by parsing many grandmasters’ cases with their actions from different games is built. Secondly, this library reduces the search space by using two filtration steps based on the defined action-based and encoding-based similarity schemes. Thirdly, the minimax search tree is fed with a list extracted from the filtering stage using the alpha-beta algorithm to prune the search. The proposed evaluation function estimates the retrievably reactive moves. Finally, the best move will be selected, played on the board, and stored in the action library for future use. Many experiments were conducted to evaluate the performance of the proposed engine. Moreover, the engine played 200 games against Rybka 2.3.2a scoring 2500, 2300, 2100, and 1900 rating points. Moreover, they used the Bayeselo tool to estimate these rating points of the engine. The results illustrated that the proposed approach achieved high rating points, reaching as high as 2483 points.
Source: openalex_inverted_index · Quality: baseline
Research context
OpenAlex topics: Artificial Intelligence in Games · Sports Analytics and Performance · Educational Games and Gamification
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
References (31)
Show source-provided references
1. A review of mobile location-based games for learning across physical and virtual spaces
2. Designing collaborative learning environments using digital games
3. Learning to win: Case-based plan selection in a real-time strategy game
4. Real-time strategy experience exchanger model [real-see]
5. A retrieval strategy for case-based reasoning using similarity and association knowledge10.1109/TCYB.2013.2257746 ↗
6. Cooperative RoboCup agents using genetic case-based reasoning
7. A case-based reasoning framework for developing agents using learning by observation
8. Learning continuous action models in a real-time strategy environment
9. Transfer learning in real-time strategy games using hybrid CBR/RL
10. Using example-based reasoning for selective move generation in two player adversarial games
11. Shannon · Computer Chess Compendium · 1988 · 210.1007/978-1-4757-1968-0_1 ↗
12. Expert-driven genetic algorithms for simulating evaluation functions10.1007/s10710-010-9103-4 ↗
13. Simulating human grandmasters: Evolution and coevolution of evaluation functions
14. GP-endchess: Using genetic programming to evolve chess endgame players
15. Evolution of an efficient search algorithm for the mate-in-N problem in chess
16. An evolutionary self-learning chess program10.1109/JPROC.2004.837633 ↗
17. Further evolution of a self-learning chess program
18. An adaptive evolutionary algorithm based on tactical and positional chess problems to adjust the weights of a chess engine
19. Design of amazon chess evaluation function based on reinforcement learning
20. On the automatic generation of case libraries by chunking chess games
21. Case-based evaluation in computer chess
22. Retrieval of similar chess positions
23. Learning middle-game patterns in chess: A case study
24. An evolutionary approach for the tuning of a chess evaluation function using population dynamics10.1109/CEC.2001.934299 ↗
25. A differential evolution for the tuning of a chess evaluation function
26. Using an evolutionary algorithm for the tuning of a chess evaluation function based on a dynamic boundary strategy
27. An adaptive evolutionary algorithm based on typical chess problems for tuning a chess evaluation function
28. An evolutionary algorithm for tuning a chess evaluation function
29. An evolutionary algorithm coupled with the Hooke-Jeeves algorithm for tuning a chess evaluation function
30. Assessing the positional values of chess pieces by tuning neural networks’ weights with an evolutionary algorithm
31. Research on different heuristics for minimax algorithm insight from connect-4 game10.4236/jilsa.2019.112002 ↗