A generalised quiescence search algorithm
Artificial Intelligence - Special issue on computer chess
How computers play chess
Artificial Intelligence
Strategies anticipating a difference in search depth using opponent-model search
Theoretical Computer Science
The PN -search algorithm: application to tsume-shogi
Artificial Intelligence - Special issue on heuristic search in artificial intelligence
Artificial Intelligence - Chips challenging champions: games, computers and Artificial Intelligence
The principal continuation and the killer heuristic
ACM '77 Proceedings of the 1977 annual conference
Human Problem Solving
Artificial Intelligence - Chips challenging champions: games, computers and Artificial Intelligence
Application of the killer-tree heuristic and the lambda-search method to lines of action
Information Sciences—Informatics and Computer Science: An International Journal - Special issue: Heuristic search and computer game playing III
Study on loop problem in opening database for chinese chess programs
IEA/AIE'07 Proceedings of the 20th international conference on Industrial, engineering, and other applications of applied intelligent systems
Learning evaluation functions of Shogi positions from different sets of games
KES'07/WIRN'07 Proceedings of the 11th international conference, KES 2007 and XVII Italian workshop on neural networks conference on Knowledge-based intelligent information and engineering systems: Part III
Optimistic selection rule better than majority voting system
CG'10 Proceedings of the 7th international conference on Computers and games
Analyze and guess type of piece in the computer game intelligent system
FSKD'05 Proceedings of the Second international conference on Fuzzy Systems and Knowledge Discovery - Volume Part II
Dual lambda search and shogi endgames
ACG'05 Proceedings of the 11th international conference on Advances in Computer Games
| Hi-index | 0.00 |
This paper describes the current state of the art in computer shogi. Shogi (Japanese chess) promises to be a good vehicle for future research into game-playing programs that are based on tree-searching paradigms. This paper shows where chess and shogi are similar, and details the important areas that make shogi programming of particular interest. A crucial difference is the game-tree complexity, which is significantly higher in shogi than in chess. Three important differences are the "drop" rule, the diverging character of the game, and the slow build-up of forces. They make it difficult to have effective opening and endgame procedures. After a short summary of the rules of shogi and an outline of the main areas of current work in computer shogi, we provide an overview of the history of computer shogi, in which computer-shogi activities both in human tournaments and in exhibition events are given. We conjecture that by the year 2010 a computer will be comparable in strength to the best human players. The most important techniques used in computer shogi are described. We focus on issues such as opening play, selective search, quiescence search, solving tactical exchanges without tree searching, position evaluation and endgame play. At the end the key challenges in computer shogi are enumerated, and finally, concluding remarks are given. Copyright 2001 Elsevier Science B.V.