112 search results - page 2 / 23 » Searching Game Trees in Parallel Using SSS |
109
click to vote
AAAI
2000
15 years 3 months ago
2000
In this paper, we present PQSOLVE, a distributed theorem-prover for Quantified Boolean Formulae. First, we introduce our sequential algorithm QSOLVE, which uses new heuristics and...
117
click to vote
CG
2010
Springer
14 years 12 months ago
2010
Springer
Monte-Carlo Tree Search (MCTS) is a successful algorithm used in many state of the art game engines. We propose to improve a MCTS solver when a game has more than two outcomes. It ...
140
click to vote
AIIDE
2008
15 years 4 months ago
2008
Classic approaches to game AI require either a high quality of domain knowledge, or a long time to generate effective AI behaviour. These two characteristics hamper the goal of es...
129
Voted
AAAI
1996
15 years 3 months ago
1996
It is known that bounds on the minimax values of nodes in a game tree can be used to reduce the computational complexity of minimax search for two-player games. We describe a very...
114
click to vote
AAAI
2006
15 years 3 months ago
2006
We derive a recursive formula for expected utility values in imperfect- information game trees, and an imperfectinformation game tree search algorithm based on it. The formula and...