Advances in Computer Games
Editat de H. Jaap Van Den Herik, Hiroyuki Iida, Ernst A. Heinzen Limba Engleză Hardback – 30 noi 2003
| Toate formatele și edițiile | Preț | Express |
|---|---|---|
| Paperback (1) | 955.17 lei 6-8 săpt. | |
| Springer – 3 mai 2013 | 955.17 lei 6-8 săpt. | |
| Hardback (1) | 960.87 lei 6-8 săpt. | |
| Springer – 30 noi 2003 | 960.87 lei 6-8 săpt. |
Preț: 960.87 lei
Preț vechi: 1201.09 lei
-20% Nou
Puncte Express: 1441
Preț estimativ în valută:
170.06€ • 199.43$ • 149.10£
170.06€ • 199.43$ • 149.10£
Carte tipărită la comandă
Livrare economică 26 ianuarie-09 februarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9781402077098
ISBN-10: 1402077092
Pagini: 402
Ilustrații: XIV, 383 p.
Dimensiuni: 160 x 241 x 27 mm
Greutate: 0.77 kg
Ediția:2004
Editura: Springer
Locul publicării:New York, NY, United States
ISBN-10: 1402077092
Pagini: 402
Ilustrații: XIV, 383 p.
Dimensiuni: 160 x 241 x 27 mm
Greutate: 0.77 kg
Ediția:2004
Editura: Springer
Locul publicării:New York, NY, United States
Public țintă
ResearchCuprins
Evaluation Function Tuning via Ordinal Correlation.- First Experimental Results of ProbCut Applied to Chess.- Search versus Knowledge: An Empirical Study of Minimax on KRK.- Static Recognition of Potential Wins in KNNKB and KNNKN.- Model Endgame Analysis.- Chess Endgames: Data and Strategy.- Evaluation in Go by a Neural Network using Soft Segmentation.- When One Eye is Sufficient: A Static Classification.- DF-PN in Go: An Application to the One-Eye Problem.- Learning to Score Final Positions in the Game of Go.- Monte-Carlo Go Developments.- Static Analysis by Incremental Computation in Go Programming.- Building the Checkers 10-piece Endgame Databases.- The 7-piece Perfect Play Lookup Database for the Game of Checkers.- Search and Knowledge in Lines of Action.- An Evaluation Function for Lines of Action.- Solving 7 × 7 Hex: Virtual Connections and Game-State Reduction.- Automated Identification of Patterns in Evaluation Functions.- An Evaluation Function for the Game of Amazons.- Opponent-Model Search in Bao: Conditions for a Successful Application.- Computer Programming of Kriegspiel Endings: The Case of KR versus K.- Searching with Analysis of Dependencies in a Solitaire Card Game.- Solving the Oshi-Zumo Game.- New Games Related to Old and New Sequences.- Author Index.