As a guest user you are not logged in or recognized by your IP address. You have
access to the Front Matter, Abstracts, Author Index, Subject Index and the full
text of Open Access publications.
We present Multiple-Outcome Proof Number Search (MOPNS), a Proof Number based algorithm able to prove positions in games with multiple outcomes. MOPNS is a direct generalization of Proof Number Search (PNS) in the sense that both behave exactly the same way in games with two outcomes. However, MOPNS targets a wider class of games. When a game features more than two outcomes, PNS can be used multiple times with different objectives to finally deduce the value of a position. On the contrary, MOPNS is called only once to produce the same information. We present experimental results on solving various positions of the games CONNECT FOUR and WOODPUSH showing that in most problems, the total number of node creations of MOPNS is lower than the cumulative number of node creations of PNS, even in the best case where PNS does not need to perform a binary search.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.