Pattern Knowledge for Proof-Number Search in Computer Go
نویسندگان
چکیده
Over the years, proof-number search has successfully been applied to many game domains. This article proposes two new pattern-based heuristics for move ordering in proof-number search. One heuristic applies patterns directly, the other heuristic uses patterns to control Monte-Carlo sampling. The test domain is the Life-and-Death problem in the game of Go. Experimentally, we found some advantages in memory consumption indicating that the pattern heuristics are promising. Future research will prove the patterns’ quality for proof-numbersearch applications.
منابع مشابه
Monte-Carlo Proof-Number Search for Computer Go
In the last decade, proof-number search and Monte-Carlo methods have successfully been applied to the combinatorial-games domain. Proof-number search is a reliable algorithm. It requires a well defined goal to prove. This can be seen as a disadvantage. In contrast to proof-number search, Monte-Carlo evaluation is a flexible stochastic evaluation for game-tree search. In order to improve the eff...
متن کاملGo-Moku and Threat-Space Search
Many decades ago, Japanese professional Go-Moku players stated that Go-Moku (Five-in-a-row on a horizontally placed 15×15 board) is a won game for the player to move first. So far, this claim has never been substantiated by (a tree of) variations or by a computer program. Meanwhile many variants of Go-Moku with slightly different rules have been developed. This paper shows that for two common v...
متن کاملA solution to the GHI problem for depth-first proof-number search
The Graph–History interaction (GHI) problem is a notorious problem that causes game-playing programs to occasionally return incorrect solutions. This paper presents a practical method to cure the GHI problem for the case of the df-pn algorithm. Results in the game of Go with the situational super-ko rule show that the overhead incurred by our method is very small, while correctness is always gu...
متن کاملDiscovering Popular Clicks\' Pattern of Teen Users for Query Recommendation
Search engines are still the most important gates for information search in internet. In this regard, providing the best response in the shortest time possible to the user's request is still desired. Normally, search engines are designed for adults and few policies have been employed considering teen users. Teen users are more biased in clicking the results list than are adult users. This leads...
متن کاملGo-Moku Solved by New Search Techniques
Many decades ago, Japanese professional Go-Moku players stated that Go-Moku (Five-in-a-row on horizontally placed 15×15 board) is a won game for the player to move fast. So far, this claim has never been substantiated by (a tree of) variations or by computer program. Meanwhile many variants of Go-Moku with slightly different rules have been developed. This paper shows that for two common varian...
متن کامل