1 option
Computers and Games : Second International Conference, CG 2001, Hamamatsu, Japan, October 26-28, 2000 Revised Papers / edited by Tony Marsland, Ian Frank.
LIBRA Q341 .P7 2004
Available from offsite location
- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- Lecture notes in computer science 0302-9743 ; 2063.
- Lecture Notes in Computer Science, 0302-9743 ; 2063
- Language:
- English
- Subjects (All):
- Computer science.
- Computers.
- Artificial intelligence.
- Computer science--Mathematics.
- Algorithms.
- Data structures (Computer science).
- Popular Computer Science.
- Theory of Computation.
- Artificial Intelligence.
- Mathematics of Computing.
- Algorithm Analysis and Problem Complexity.
- Data Structures.
- Local Subjects:
- Popular Computer Science.
- Theory of Computation.
- Artificial Intelligence.
- Mathematics of Computing.
- Algorithm Analysis and Problem Complexity.
- Data Structures.
- Physical Description:
- 1 online resource (XIV, 450 pages).
- Edition:
- First edition 2001.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2001.
- System Details:
- text file PDF
- Contents:
- Search and Strategies
- A Least-Certainty Heuristic for Selective Search
- Lambda-Search in Game Trees - with Application to Go
- Abstract Proof Search
- Solving Kriegspiel-Like Problems: Examining Efficient Search Methods
- Strategies for the Automatic Construction of Opening Books
- Awari Retrograde Analysis
- Construction of Chinese Chess Endgame Databases by Retrograde Analysis
- Learning and Pattern Acquisition
- Learning from Perfection
- Chess Neighborhoods, Function Combination, and Reinforcement Learning
- Learning a Go Heuristic with Tilde
- Learning Time Allocation Using Neural Networks
- Theory and Complexity Issues
- The Complexity of Graph Ramsey Games
- Virus Versus Mankind
- Creating Difficult Instances of the Post Correspondence Problem
- Integer Programming Based Algorithms for Peg Solitaire Problems
- Ladders Are PSPACE-Complete
- Simple Amazons Endgames and Their Connection to Hamilton Circuits in Cubic Subgrid Graphs
- Further Experiments with Games
- New Self-Play Results in Computer Chess
- SUPER-SOMA - Solving Tactical Exchanges in Shogi without Tree Searching
- A Shogi Processor with a Field Programmable Gate Array
- Plausible Move Generation Using Move Merit Analysis with Cut-Off Thresholds in Shogi
- Abstraction Methods for Game Theoretic Poker
- Reasoning by Agents in Computer Bridge Bidding
- Invited Talks and Reviews
- Linguistic Geometry for Solving War Games
- Physics and Ecology of Rock-Paper-Scissors Game
- Review: Computer Language Games
- Review: Computer Go 1984-2000
- Review: Intelligent Agents for Computer Games
- Review: RoboCup through 2000
- Review: Computer Shogi through 2000.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-45579-0
- 9783540455790
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.