ISBN: 9786130639655 - hackenbush: mathematical game, line segment, finite set, combinatorial game theory, sprague-grundy theorem, on numbers and games, winning ways for ... plays, dyadic rational, ordinal number (3 Ergebnisse)

Taschenbuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware 80 pp. Englisch.

Taschenbuch. Zustand: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Please note that the content of this book primarily consists of articlesavailable from Wikipedia or other free sources online.Hackenbush is atwo-player mathematical game which may be played on any configuration ofcolored line segments connected to one another by their endpoints and tothe ground. More precisely, there is a ground (conventionally, but notnecessarily, a horizontal line at the bottom of the paper or otherplaying area) and several line segments such that each line segment isconnected to the ground, either directly at an endpoint, or indirectlyvia a chain of other segments connected by endpoints. Any number ofsegments may meet at a point and thus there may be multiple paths toground. On his turn, a player 'cuts' (erases) a line segment of hischoice (from those which he is allowed to select - see below). Everyline segment which is no longer connected to the ground by any path'falls' (also gets erased). According to the normal play convention ofcombinatorial game theory, the first player who is unable to move(because either all segments have been erased, or all those that remainbelong to his opponent) loses. Hackenbush boards can consist of finitelymany (in the case of a 'finite board') or infinitely many (in the caseof an 'infinite board') line segments.…

Taschenbuch. Zustand: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Please note that the content of this book primarily consists of articlesavailable from Wikipedia or other free sources online.Hackenbush is atwo-player mathematical game which may be played on any configuration ofcolored line segments connected to one another by their endpoints and tothe ground. More precisely, there is a ground (conventionally, but notnecessarily, a horizontal line at the bottom of the paper or otherplaying area) and several line segments such that each line segment isconnected to the ground, either directly at an endpoint, or indirectlyvia a chain of other segments connected by endpoints. Any number ofsegments may meet at a point and thus there may be multiple paths toground. On his turn, a player 'cuts' (erases) a line segment of hischoice (from those which he is allowed to select - see below). Everyline segment which is no longer connected to the ground by any path'falls' (also gets erased). According to the normal play convention ofcombinatorial game theory, the first player who is unable to move(because either all segments have been erased, or all those that remainbelong to his opponent) loses. Hackenbush boards can consist of finitelymany (in the case of a 'finite board') or infinitely many (in the caseof an 'infinite board') line segments.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 80 pp. Englisch.…