Computers and Games
Second International Conference, CG 2001, Hamamatsu, Japan, October 26-28, 2000 Revised Papers
Series: Lecture Notes in Computer Science; 2063;
- Publisher's listprice EUR 53.49
-
22 690 Ft (21 609 Ft + 5% VAT)
The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.
- Discount 20% (cc. 4 538 Ft off)
- Discounted price 18 152 Ft (17 287 Ft + 5% VAT)
Subcribe now and take benefit of a favourable price.
Subscribe
22 690 Ft
Availability
Estimated delivery time: In stock at the publisher, but not at Prospero's office. Delivery time approx. 3-5 weeks.
Not in stock at Prospero.
Why don't you give exact delivery time?
Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.
Product details:
- Edition number 2001
- Publisher Springer
- Date of Publication 9 January 2002
- Number of Volumes 1 pieces, Book
- ISBN 9783540430803
- Binding Paperback
- No. of pages450 pages
- Size 235x155 mm
- Weight 1430 g
- Language English
- Illustrations XIV, 450 p. 0
Categories
Long description:
Springer Book Archives
MoreTable of 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.
More
