This paper proposes a new approach for proof number (PN) search, named job-level PN (JL-
PN) search, where each search tree node is evaluated or expanded by a heavy-weight job …

This paper introduces an approach, called generic job-level search, to leverage the game-
playing programs which are already written and encapsulated as jobs. Such an approach is …

This paper proposes a new search algorithm, denoted PN∗, for AND/OR tree search. The
algorithm is based on proof-number (PN) search, a best-first search algorithm, proposed by …

Efficiency is critical for game programs. This paper improves the search efficiency of
Connect6 program by encoding connection patterns and computing the inherent information …

Proof-Number (PN) search is a best-first adversarial search algorithm especially suited for
finding the game-theoretical value in game trees. The strategy of the algorithm may be …

Various efficient game problem solvers are based on PN-Search. Especially depth-first
versions of PN-Search like DF-PN or PDS–contrary to other known techniques–are able to …

This thesis investigates how selective-search methods can improve the performance of a
game program for a given domain. Selective-search methods aim to explore only the …

This thesis investigates how search can be guided by knowledge in such a way that the
search space is traversed efficiently and effectively. For this task we focus on the question …

The paper introduces a new proof-number (PN) search algorithm, called PDS-PN. It is a two-
level search, which performs at the first level a depth-first Proof-number and Disproof …

Fanorona is the national board game of Madagascar. The game's complexity is
approximately the same as that of checkers. In this article, we present a search-based …