Five-In-Row with Local Evaluation and Beam Search
Jiun-Hung Chen, Adrienne X. Wang · 2004
This report provides a brief overview of the game of five-in-row, also known as Go-Moku, the basic structure of our program, and the heuristics we develop to improve the efficiency of searching. The basic search algorithm is min-max search with alpha-beta pruning. With a sorted successor list at each level, we are able to explore beam search which bounds the number of searching branches and analyze the improvement.