Computers and Games
Springer Berlin (Verlag)
978-3-540-65766-8 (ISBN)
Search and Strategies.- Relevance Cuts: Localizing the Search.- Multi-cut Pruning in Alpha-Beta Search.- A Solution to the GHI Problem for Best-First Search.- Optimal Play against Best Defence: Complexity and Heuristics.- A Speculative Strategy.- An Adversarial Planning Approach to Go.- Learning and Pattern Acquisition.- First Results from Using Temporal Difference Learning in Shogi.- From Simple Features to Sophisticated Evaluation Functions.- A Two-Step Model of Pattern Acquisition: Application to Tsume-Go.- A Neural Network Program of Tsume-Go.- Distributed Decision Making in Checkers.- Theory.- Game Tree Algorithms and Solution Trees.- A New Heap Game.- Infinite Cyclic Impartial Games.- On the Complexity of Tsume-Go.- Extended Thermography for Multiple Kos in Go.- Go, Tsume-Shogi, and Heian-Shogi.- Computer Go: A Research Agenda.- Estimating the Possible Omission Number for Groups in Go by the Number of n-th Dame.- Relations between Skill and the Use of Terms.- A Survey of Tsume-Shogi Programs Using Variable-Depth Search.- Retrograde Analysis of the KGK Endgame in Shogi: Its Implications for Ancient Heian Shogi.
Erscheint lt. Verlag | 24.3.1999 |
---|---|
Reihe/Serie | Lecture Notes in Computer Science |
Zusatzinfo | XVIII, 335 p. 122 illus., 7 illus. in color. |
Verlagsort | Berlin |
Sprache | englisch |
Maße | 155 x 235 mm |
Gewicht | 539 g |
Themenwelt | Informatik ► Theorie / Studium ► Algorithmen |
Informatik ► Theorie / Studium ► Künstliche Intelligenz / Robotik | |
Informatik ► Weitere Themen ► Computerspiele | |
Mathematik / Informatik ► Mathematik ► Wahrscheinlichkeit / Kombinatorik | |
Schlagworte | Algorithm analysis and problem complexity • Algorithmic Learning • algorithms • Computer Games • learning • Mathematical Games • Pattern Acquisition • search strategies • service-oriented computing |
ISBN-10 | 3-540-65766-5 / 3540657665 |
ISBN-13 | 978-3-540-65766-8 / 9783540657668 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich