Bitboard knowledge base system and elegant search architectures for Connect6

Authors:
Shi-Jim Yen;Jung-Kuei Yang;Kuo-Yuan Kao;Tai-Ning Yang
Affiliations:
Department of Computer Science and Information Engineering, National Dong Hwa University, Hualien, Taiwan;Department of Applied Foreign Languages, Lan Yang Institute of Technology, I Lan, Taiwan;Department of Information Management, National Penghu University, Penghu, Taiwan;Department of Computer Science and Information Engineering, Chinese Culture University, Taipei, Taiwan
Venue:
Knowledge-Based Systems
Year:
2012

Citing 15
Cited 0

Proof-number search

Artificial Intelligence
The PN -search algorithm: application to tsume-shogi

Artificial Intelligence - Special issue on heuristic search in artificial intelligence
Efficient Search Using Bitboard Models

ICTAI '06 Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence
A method to construct knowledge table-base in k-in-a-row games

Proceedings of the 2009 ACM symposium on Applied Computing
Search versus knowledge for solving life and death problems in Go

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
Efficient selectivity and backup operators in Monte-Carlo tree search

CG'06 Proceedings of the 5th international conference on Computers and games
Improving depth-first PN-search: 1 + Ɛ trick

CG'06 Proceedings of the 5th international conference on Computers and games
Job-level proof-number search for connect6

CG'10 Proceedings of the 7th international conference on Computers and games
Monte-Carlo tree search and rapid action value estimation in computer Go

Artificial Intelligence
Bandit based monte-carlo planning

ECML'06 Proceedings of the 17th European conference on Machine Learning
Randomized parallel proof-number search

ACG'09 Proceedings of the 12th international conference on Advances in Computer Games
A new family of k-in-a-row games

ACG'05 Proceedings of the 11th international conference on Advances in Computer Games
Single-player Monte-Carlo tree search for SameGame

Knowledge-Based Systems
Nested Monte-Carlo Search with simulation reduction

Knowledge-Based Systems
Dynamic randomization and domain knowledge in Monte-Carlo Tree Search for Go knowledge-based systems

Knowledge-Based Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Efficiency is critical for game programs. This paper improves the search efficiency of Connect6 program by encoding connection patterns and computing the inherent information in advance. Such information is saved in a bitboard knowledge base system, where special bitwise operations are designed. This paper also proposes efficient methods of generating threat moves and the Multistage Proof Number Search. The methods reduce the time complexity of generating threat moves. The search improves the search performance by developing candidate moves in stages according to their importance. In brief, this paper proposes an efficient knowledge base system and elegant search architectures for Connect6. It is expected that the proposed methods can be applied to all kinds of Connect-k games.