Abstract
Classical search methods on game trees are based on a static evaluation function (that enable quantitative valuation of game states) and a decision strategy (such as the minimax method). These search methods are not always effective in some games such as the game of Go, as construction of the evaluation function is very hard and the search space is extremely huge. Recently, Monte Carlo tree search methods (especially the UCT algorithms) that enable efficient sampling of actions have been shown to be very effective. Here, we propose the loosely symmetric (LS) model applied to trees (LST), which utilises an action value function (LS model) that implements causal intuition of humans. By tuning a single intuitive parameter, LST enables fast search of the optimal action with its efficient satisficing behaviour. The satisficing search realised by LST enables pruning and exhibits intermediate properties between those of breadth-first and depth-first search strategies.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Journal of Parallel, Emergent and Distributed Systems
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.