Ernst A. Heinz – författare
Visar alla böcker från författaren Ernst A. Heinz. Handla med fri frakt och snabb leverans.
7 produkter
Advances in Computer Games
Many Games, Many Challenges
Av Ernst A. Heinz, Hiroyuki Iida m. fl.
E-bok, 2013
2111 kr
Lägg i varukorg
1 feel privileged that the J(jh Advances in Computer Games Conference (ACG 10) takes place in Graz, Styria, Austria. It is the frrst time that Austria acts as host country for this major event. The series of conferences started in Edinburgh, Scotland in 1975 and was then held four times in England, …
Advances in Computer Games
Many Games, Many Challenges
Av H. Jaap van den Herik, Hiroyuki Iida m. fl.
Inbunden, 2003
1686 kr
Lägg i varukorg
1 feel privileged that the J(jh Advances in Computer Games Conference (ACG 10) takes place in Graz, Styria, Austria. It is the frrst time that Austria acts as host country for this major event. The series of conferences started in Edinburgh, Scotland in 1975 and was then held four times in England, …
Advances in Computer Games
Many Games, Many Challenges
Av H. Jaap van den Herik, Hiroyuki Iida m. fl.
Häftad, 2013
1637 kr
Lägg i varukorg
1 feel privileged that the J(jh Advances in Computer Games Conference (ACG 10) takes place in Graz, Styria, Austria. It is the frrst time that Austria acts as host country for this major event. The series of conferences started in Edinburgh, Scotland in 1975 and was then held four times in England, …
Scalable Search in Computer Chess
Algorithmic Enhancements and Experiments at High Search Depths
E-bok, 2013
1413 kr
Lägg i varukorg
This book presents the results of our past two-and-a-half years of research aimed at increasing the scalability and performance of game-tree search in computer chess. We elaborate on our respective works in the areas of (I) selective forward pruning, (II) the efficient application of …
Scalable Search in Computer Chess
Algorithmic Enhancements and Experiments at High Search Depths
Av Ernst A. Heinz, Wolfgang Bibel
Häftad, 1999
1121 kr
Lägg i varukorg
This book presents the results of our past two-and-a-half years of research aimed at increasing the scalability and performance of game-tree search in computer chess. We elaborate on our respective works in the areas of (I) selective forward pruning, (II) the efficient application of …
