Games solved: now and in the future
Artificial Intelligence - Chips challenging champions: games, computers and Artificial Intelligence
Efficient Search Using Bitboard Models
ICTAI '06 Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence
On the fairness and complexity of generalized k-in-a-row games
Theoretical Computer Science
A new family of k-in-a-row games
ACG'05 Proceedings of the 11th international conference on Advances in Computer Games
Bitboard knowledge base system and elegant search architectures for Connect6
Knowledge-Based Systems
| Hi-index | 0.00 |
In any k-in-a-row game, the player should always analyze each consecutive sequence in 4 directions, which consists of either the void intersections or the intersections occupied by the same color stones. Although the difficult problem in k-in-a-row game is that any void intersection on board can be placed a stone on, just like Go, however, the hints in k-in-a-row are far more than those in Go. We find it is a good method to decrease the complexity of the k-in-a-row games by using Connection to represent the states of the game position. Then, a precise classification criterion for Connection, as well as a precise classification for the intersections is given. As the high-level knowledge of games seems hard to be acquired, the program designers always resort to human masters. However, we can construct a good knowledge table-base based on above idea without masters.