Computers and Games
Springer Berlin (Verlag)
978-3-540-32488-1 (ISBN)
Efficient Control of Selective Simulations.- Game-Tree Search with Adaptation in Stochastic Imperfect-Information Games.- Rediscovering *-Minimax Search.- *-Minimax Performance in Backgammon.- Associating Shallow and Selective Global Tree Search with Monte Carlo for 9 × 9 Go.- Learning to Estimate Potential Territory in the Game of Go.- An Improved Safety Solver for Computer Go.- Searching for Compound Goals Using Relevancy Zones in the Game of Go.- Rule-Tolerant Verification Algorithms for Completeness of Chinese-Chess Endgame Databases.- An External-Memory Retrograde Analysis Algorithm.- Generating an Opening Book for Amazons.- Building a World-Champion Arimaa Program.- Blockage Detection in Pawn Endings.- Dao: A Benchmark Game.- Incremental Transpositions.- Kayles on the Way to the Stars.- Searching over Metapositions in Kriegspiel.- The Relative History Heuristic.- Locally Informed Global Search for Sums of Combinatorial Games.- Current Challenges in Multi-player Game Search.- Preventing Look-Ahead Cheating with Active Objects.- Strategic Interactions in the TAC 2003 Supply Chain Tournament.
Erscheint lt. Verlag | 10.2.2006 |
---|---|
Reihe/Serie | Lecture Notes in Computer Science | Theoretical Computer Science and General Issues |
Zusatzinfo | XIV, 334 p. |
Verlagsort | Berlin |
Sprache | englisch |
Maße | 155 x 233 mm |
Gewicht | 1100 g |
Themenwelt | Sachbuch/Ratgeber ► Natur / Technik ► Naturwissenschaft |
Mathematik / Informatik ► Informatik ► Theorie / Studium | |
Schlagworte | AI Planning • Algorithm analysis and problem complexity • Algorithmic Learning • Artificial Intelligence • Chess • combinatorics • Computer • computer chess • computer chess championship • Computer Games • computers and games • Database • Data Mining • Game Theory • Heuristics • Intelligence • learning • pattern association • Reinforcement Learning • Search algorithms • search strategies |
ISBN-10 | 3-540-32488-7 / 3540324887 |
ISBN-13 | 978-3-540-32488-1 / 9783540324881 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich