Abstract

In games like chess, the node-expansion strategy significantly affects the performance of a game-playing program. In this article we propose a new game-tree search algorithm that uses the realization probabilities of nodes for deciding upon the range

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call