They cover a wide range of topics such as monte-carlo tree search, proof-number search, UCT algorithm, scalability, parallelization, opening books, knowledge abstraction, solving games, consultation of players, multi-player games, extraversion, and combinatorial game theory.
Read More
They cover a wide range of topics such as monte-carlo tree search, proof-number search, UCT algorithm, scalability, parallelization, opening books, knowledge abstraction, solving games, consultation of players, multi-player games, extraversion, and combinatorial game theory.
Read Less
Publisher:
Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Published:
2011
Language:
English
Alibris ID:
17964241403
Shipping Options:
Standard Shipping: $4.62
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
New. Contains: Illustrations, black & white, Illustrations, color. Theoretical Computer Science and General Issues ; Lecture Notes in Computer Science . XVIII, 277 p. 99 illus., 23 illus. in color. Intended for professional and scholarly audience.