Conspiracy numbers for min-max search
Artificial Intelligence
Artificial Intelligence - Special issue on computer chess
Singular extensions: adding selectivity to brute-force searching
Artificial Intelligence - Special issue on computer chess
Artificial Intelligence
Artificial Intelligence
Problem-Solving Methods in Artificial Intelligence
Problem-Solving Methods in Artificial Intelligence
Solving Kriegspiel-Like Problems: Examining Efficient Search Methods
CG '00 Revised Papers from the Second International Conference on Computers and Games
Review: Computer Shogi through 2000
CG '00 Revised Papers from the Second International Conference on Computers and Games
| Hi-index | 0.00 |
Recently, a number of programs have been developed that successfully apply variable-depth search to find solutions for mating problems in Japanese chess, called tsume shogi. Publications on this research domain have been written mainly in Japanese. To present the findings of this research to a wider audience, we compare six different tsume programs. To find the solutions of difficult tsume-shogi problems with solution sequences longer than 20 plies, we will see that variable-depth search and hashing to deal with a combination of transposition, domination and simulation leads to strong tsume-shogi programs that outperform human experts, both in speed and in the number of problems for which the solution can be found. The best program has been able to solve Microcosmos, a tsume-shogi problem with a solution sequence of 1525 plies.