Sciweavers

3455 search results - page 103 / 691
» Generalized Game Trees
Sort
View
SIGECOM
2006
ACM
139views ECommerce» more  SIGECOM 2006»
15 years 10 months ago
Playing games in many possible worlds
In traditional game theory, players are typically endowed with exogenously given knowledge of the structure of the game—either full omniscient knowledge or partial but fixed in...
Matt Lepinski, David Liben-Nowell, Seth Gilbert, A...
WG
2005
Springer
15 years 10 months ago
Algebraic Operations on PQ Trees and Modular Decomposition Trees
Partitive set families are families of sets that can be quite large, but have a compact, recursive representation in the form of a tree. This tree is a common generalization of PQ...
Ross M. McConnell, Fabien de Montgolfier
ACG
2009
Springer
15 years 11 months ago
Solving Kriegspiel Endings with Brute Force: The Case of KR vs. K
Retrograde analysis is a tool for reconstructing a game tree starting from its leaves; with these techniques one can solve specific subsets of a complex game, achieving optimal pl...
Paolo Ciancarini, Gian Piero Favini
AI
2002
Springer
15 years 4 months ago
Parallel Randomized Best-First Minimax Search
We describe a novel parallel randomized search algorithm for two-player games. The algorithm is a randomized version of Korf and Chickering's best-first search. Randomization...
Yaron Shoham, Sivan Toledo
ACMACE
2009
ACM
15 years 9 months ago
Critical gameplay
How do games effect the way we problem solve, socialize, or even view the world? When we shoot do we learn to destroy obstacles instead of work around them? Does the binary world ...
Lindsay Grace