This fascinating look at combinatorial games, that is, games not involving chance or hidden information, offers updates on standard games such as Go and Hex, on impartial games such as Chomp and Wythoff�s Nim, and on aspects of games with infinitesimal values, plus analyses of the complexity of some games and puzzles and surveys on algorithmic game theory, on playing to lose, and on coping with cycles. The volume is rounded out with an up-to-date bibliography by Fraenkel and, for readers eager to get their hands dirty, a list of unsolved problems by Guy and Nowakowski. Highlights include some of Siegel�s groundbreaking work on loopy games, the unveiling by Friedman and Landsberg of the use of renormalization to give very intriguing results about Chomp, and Nakamura�s �Counting Liberties in Capturing Races of Go.� Like its predecessors, this book should be on the shelf of all serious games enthusiasts.
Playing games with algorithms: algorithmic combinatorial game theory
págs. 3-56
págs. 57-89
págs. 91-123
págs. 125-131
págs. 135-150
págs. 151-161
págs. 163-176
págs. 177-196
págs. 197-214
págs. 215-232
A library of eyes in Go, I: a life-and-death definition consistent with bent-4
págs. 233-247
págs. 249-268
M.H. Albert, R.E.L. Aldred, M. D. Atkinson, C.C. Handley, Derek Holton, D.J. McCaughan, Bruce E. Sagan
págs. 309-327
págs. 329-347
On the geometry of combinatorial games: a renormalization approach
págs. 349-376
págs. 377-410
págs. 413-418
págs. 419-425
págs. 427-445
págs. 447-461
págs. 465-489
págs. 491-575
© 2001-2024 Fundación Dialnet · Todos los derechos reservados