Cargando…

Computers and Games 4th International Conference, CG 2004, Ramat-Gan, Israel, July 5-7, 2004. Revised Papers /

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor Corporativo: SpringerLink (Online service)
Otros Autores: Herik, H. Jaap van den (Editor ), Björnsson, Yngvi (Editor ), Netanyahu, Nathan S. (Editor )
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2006.
Edición:1st ed. 2006.
Colección:Theoretical Computer Science and General Issues, 3846
Temas:
Acceso en línea:Texto Completo

MARC

LEADER 00000nam a22000005i 4500
001 978-3-540-32489-8
003 DE-He213
005 20230406002856.0
007 cr nn 008mamaa
008 100417s2006 gw | s |||| 0|eng d
020 |a 9783540324898  |9 978-3-540-32489-8 
024 7 |a 10.1007/11674399  |2 doi 
050 4 |a QA75.5-76.95 
072 7 |a UY  |2 bicssc 
072 7 |a COM000000  |2 bisacsh 
072 7 |a UY  |2 thema 
082 0 4 |a 004  |2 23 
245 1 0 |a Computers and Games  |h [electronic resource] :  |b 4th International Conference, CG 2004, Ramat-Gan, Israel, July 5-7, 2004. Revised Papers /  |c edited by H. Jaap van den Herik, Yngvi Björnsson, Nathan S. Netanyahu. 
250 |a 1st ed. 2006. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 2006. 
300 |a XIV, 334 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Theoretical Computer Science and General Issues,  |x 2512-2029 ;  |v 3846 
505 0 |a 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. 
650 0 |a Computer science. 
650 0 |a Computer science-Mathematics. 
650 0 |a Discrete mathematics. 
650 0 |a Numerical analysis. 
650 0 |a Mathematical statistics. 
650 0 |a Artificial intelligence. 
650 0 |a Algorithms. 
650 1 4 |a Computer Science. 
650 2 4 |a Discrete Mathematics in Computer Science. 
650 2 4 |a Numerical Analysis. 
650 2 4 |a Probability and Statistics in Computer Science. 
650 2 4 |a Artificial Intelligence. 
650 2 4 |a Algorithms. 
700 1 |a Herik, H. Jaap van den.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Björnsson, Yngvi.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Netanyahu, Nathan S.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9783540820581 
776 0 8 |i Printed edition:  |z 9783540324881 
830 0 |a Theoretical Computer Science and General Issues,  |x 2512-2029 ;  |v 3846 
856 4 0 |u https://doi.uam.elogim.com/10.1007/11674399  |z Texto Completo 
912 |a ZDB-2-SCS 
912 |a ZDB-2-SXCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (SpringerNature-11645) 
950 |a Computer Science (R0) (SpringerNature-43710)