The game of checkers has roughly 500 billion billion possible positions (5× 1020). The task
of solving the game, determining the final result in a game with no mistakes made by either …

In this paper we present a method for abstracting an environment represented using
constrained Delaunay triangulations in a way that significantly reduces pathfinding search …

Abstract General Game Playing (GGP) is the art of designing programs that are capable of
playing previously unknown games of a wide variety by being told nothing but the rules of …

The game of poker offers a clean well-defined domain in which to investigate some truly
fundamental issues in computing science, such as how to handle deliberate misinformation …

This paper describes experiments using reinforcement learning techniques to compute
pattern urgencies used during simulations performed in a Monte-Carlo Go architecture …

The number of different legal positions in chess is usually estimated to be between 10^ 40
10 40 and 10^ 50 10 50. Within this range, the best upper bound 10^ 46 10 46 is some …

I lay out a slight refinement of Shoham et al.'s taxonomy of agendas that I consider sensible
for multiagent learning (MAL) research. It is not intended to be rigid: senseless work can be …

This research focuses on developing AI agents that play arbitrary Atari 2600 console games
without having any game-specific assumptions or prior knowledge. Two main approaches …

Thomsen's λ search and Nagai's depth-first proofnumber (DFPN) search are two powerful
but very different AND/OR tree search algorithms. Lambda Depth-First Proof Number search …

Abstract We revisit Depth-First Proof-Number Search (DFPN), a well-known algorithm for
solving twoplayer games. First, we consider the completeness property of the algorithm and …