A group from Hackenbush game

• 147 Accesses

Abstract

This research presents the reader some algebraic operations related to combinatorial games and gives a detailed outlook of a special game called Hackenbush game. We will deduce a group with a special feature with the help of some basic algebraic concepts. A fresh outlook to some combinatorial mathematical algebraic operations and concepts through the evaluation of a deduced group from this game.

Introduction

As a result of the many mathematical research done by Lagrange, Abel, Galois, and others in the fields of geometry, number’s theory, and algebraic equations at the end of the eighteenth century, early nineteenth century, the mathematical theory of “groups” was discovered [1,2,3]. That theory has led researchers to the discovery of many essential mathematical concepts such as “sub-groups,” “graphs and groups,” and plenty others. By building on previous credited works and researches, we can express mathematical groups as graphs. By analyzing the structures of graphs, we can deduce the properties of their related groups, which can be done by exploiting the notion of “identity” in “group theory.”

By expressing groups by their associated graphs, or in other words “identity graphs,” we can utilize the “identity graphs” theory’s equations and concepts to conclude the following.

Two elements x, y in a group are adjacent or can be joined by an edge if x. y = e (e, identity element of G).

Since we know that x. y = y. x = e, there is no need to utilize the property of commutatively. It is by convention; every element is adjoined with the identity of the group G. This is the convention we use when trying to represent a group by a graph. The vertices correspond to the elements of the group, hence the order of the group G corresponds to the number of vertices in the identity graph [4, 5].

For example, see the identity graph for some groups in Figs. 1 and 2.

In this research, we will utilize the concepts of “graph theory” to analyze some combinatorial mathematical algebraic operations and concepts through the evaluation of a deduced group from a combinatorial game called “Hackenbush game.”

Combinatorial games theory

“Combinatorial game theory” describes the study of sequential games with perfect information. When playing “Hackenbush,” all players know all the possible outcomes from a given position with no randomness . The game is defined with the following attributes:

1. (A)

There are two players, left and right.

2. (B)

There is always a finite number of positions, in addition to a starting position.

The game is played by the following rules:

1. (C)

Left and right alternate making moves.

2. (D)

Both players have access to all information always.

3. (E)

There is no randomness to moves made, such as rolling a dice.

4. (F)

A player loses when he/she can no longer make any legal moves.

5. (G)

The game ends when the ending condition is met.

If we have a game G and this game includes options for player L named GL and options for player R named GR.

Now, we will try to explain the manner of dealing with the games, as well as showing its rules.

1. (A)

G = {GL| GR}

Numbers represent the number of free moves or the moves possible to a particular player. By convention, positive numbers represent an advantage for left, while negative numbers represent an advantage for right. They are defined recursively with 0 being the base case.

1. (B)

0 = { | } we will explain Zero game in detail in the section “Hackenbush game”.

2. (C)

G = 0 means the first player loses

3. (D)

1 = {0 | }, 2 = {1 | }, 3 = {2 | }

4. (E)

−1 = { | 0}, − 2 = { | −1}, − 3 = { | −2 }

Star, written as * or {0|0}, is the first player’s wins since either player must move to a Zero game, which will be defined later in the research, therefore wins.

* + * = 0, because the first player must turn one copy of * to a 0, and the other player will have to turn the other copy of * to a 0 as well, at this point, the first player would lose, since 0 + 0 admits no moves.

Like all other games, the game * is neither positive nor negative, in which the first player wins.

1. (F)

= {0 | 0 }

2. (G)

=  −

3. (H)

G ║ 0 means the second player loses

4. (I)

G > 0 means left wins

5. (J)

G < 0 means right wins

Up, written as ↑, is a position in combinatorial game theory . In standard notation,

1. (K)

↑ = {0| }

Down, written as ↓, is a position in combinatorial game theory . In standard notation,

1. (L)

↓ = {| 0 }

2. (M)

↓ =  − ↑

We will explain the last two definitions in detail in the next section.

Hackenbush game

In Hackenbush, the drawn figure uses vertices and line segments, which are connected to a final line called the ground. Players take turns deleting one of their lines. Therefore, left and right take on the colors blue and red respectively. If there is, at any time, a path that cannot be drawn from the ground to a line segment, the segment is deleted. This allows for more strategic plays as a player can delete an opponent’s move during their turn [7, 8]. Figure 3 is an example of the Hackenbush game.

Now, we will discuss how the game is played. In a game represented by Fig. 3. We will pick left to make the first move. Left has two legal moves. He can either remove the line on the right or the line on the top of the red line. However, the latter move is best, because it allows right to take his middle piece, and effectively remove left’s piece with it. Likewise, right should take his middle piece if he moves first for that same exact reason. That would be the optimal plays in that current example. Mathematically, after every move, the resulting game’s board becomes a sub-game of the original game’s board, or in other words, a new game with new independent possibilities [9, 10].

Assuming optimal plays are always being made, finite values can be assigned to each game or sub-game. These values are determined by observing the advantages the left player has, after each move. For example, after Left makes a move, he has a moves advantage over right, but after right moves, left has b moves advantage over right.

Those values could be written in the form {a| b}. This form does not make any quantifiable sense at the moment, because of the actual value determined by what “a” and “b” are.

Before explaining how to find those values, we will first consider the case in which there are no legal moves for neither players, left or right. Therefore, the player’s (with no legal moves) score is left blank in the notation. If both players have no legal moves, the result is a Zero game.

Definition 3.1. A Zero-game

A Zero-game is a game that scores { | } = 0, or in other words, the player who moves next loose, assuming all moves made are optimal.

For Hackenbush, the simplest form of a Zero game equates to an empty board at the beginning. Thus, it is obvious the first player to move has no legal move, therefore loses. In another scenario, if we were to add one blue line, left would have 0 moves after he removes the only possible line, and right would have no legal move giving left a clear 1 move advantage, written {0| } = 1. This trend continues in such a manner that {n| } = n + 1, as n equals the number of remaining moves left has, after making the optimal move .

However, what will happen if we add the red line instead? As done before, these values are applied with respect to the advantage of the left player. Thus, adding one line for right results in putting left at a one move disadvantage, or a (−1) advantage. So, adding one red line results in { | 0} =  − 1. Adding two red lines would then be { | −1} =  − 2. And so on to a general form of { | −n} =  − (n + 1), as n equals the number of remaining moves right has after the optimal move.

Now with the groundwork out of the way, we can start using the values of sub-games to determine the value of an overall game, for example, see Fig. 4.

After left moves, right has one legal move. In that case, we clearly have a { | 0 } =  − 1 situation. Conversely, if right moves first, we have { 0 | } = 1. This results in the overall game having a value of {−1| 1} = 0. It makes sense because we equally added one independent move for both players to an empty board , which means that the advantage does not change. But what about the game in Fig. 5?

Now both players have been given one line each. But if left moves, right’s only legal move is eliminated, but if right moves, left will still have one legal move. It is not so clear what the given value of this game by implementing the “scoring rules” discussed earlier. That is why we must utilize a new rule called the “simplicity rule,” to assign values to the previous example .

Definition 3.2. A * game

A * game (pronounced star game) is an infinitesimal game that scores.

{0| 0} =  resulting in the first player to move wins, assuming all moves made are optimal .

For example, Hackenbush’s game has another line type that is green, which is claimable by either player. Then, we get the following game which results in a value of {0| 0} =  (see Fig. 6). Building on the previous concept, we can see results like {n| −n} = n, as n  = n + . It is also worth noting that has the property such that  +    = 0, see Fig. 6.

Furthermore, there are more two infinitesimal games.

Definition 3.3. An ↑ game

An ↑-game (pronounced “up game”) is a positive infinitesimal game as the score is {0| }, favoring the Left player , as shown in Fig. 7:

The negative version of an up game is called a down game and defined as follows.

Definition 3.4. An ↓game

A ↓ game (pronounced “down game”) is a negative infinitesimal game as the score is {| 0} which favors the right player .

The relation between “up” and “down” games represents the relation among the inverses of games. In every game, there is a way to reverse every move, which results in negating the value of the game originally obtained. In Hackenbush, this is obtained by replacing every red line with a blue line and vice versa. See Fig. 8.

Property 3.1.

1. (A)

$$-\frac{1}{2^{\mathrm{n}}}<\downarrow <0<\uparrow <\frac{1}{2^{\mathrm{n}}}$$

for any integer n > 0.

1. (B)

↓ =  −  ↑ .

2. (C)

Both ↑ and ↓ are fuzz to .

3. (D)

$$\begin{array}{l}\left\{\uparrow |\downarrow \right\}=\left\{\uparrow |\ 0\right\}=\\ {}=\left\{0\ |\downarrow \right\}=\left\{0\ |\ 0\right\}=\ast .\end{array}}$$

Hackenbush group

For every Hackenbush’s game, a class can be defined. For example, the class of Zero game, see Fig. 9.

Let us define the binary addition operation to a set (H) of unique classes defined above

$$\mathrm{x}+y=\left\{{x}^L+\mathrm{y},\mathrm{x}+{y}^L|{x}^R+\mathrm{y},\mathrm{x}+{y}^R\right\}$$

Theorem 4.1. Addition is commutative.

Proof

Base case: G + 0 = 0 + G for all games G.

$$\mathrm{x}+y\begin{array}{c}=\left\{{x}^L+\mathrm{y},\mathrm{x}+{y}^L|{x}^R+\mathrm{y},\mathrm{x}+{y}^R\right\}\\ {}=\left\{\mathrm{y}+{x}^L,{y}^L+\mathrm{x}|\mathrm{y}+{x}^R,{y}^R+\mathrm{x}\right\}=y+x\end{array}}$$

Theorem 4.2. Addition is associative

(x + y) + z = x + (y + z) The proof is clear.

We get negate by replacing the red (R) sides with blue (L) and vice versa and keep the green (R, L) as it is, see Fig. 10.

$$-G=\left\{-{G}^R|-{G}^L\right\}$$

The effect here is that all moves of left and right are switched.

G + (−G) is a second player wins. For example, right first:

Right to move, so left wins.

We can classify the games by its outcomes (Table 1).

Definition 4.1. Hackenbush group

The set H is defined as a group because the following conditions are met.

if h, h1, h2, h3H

1. (A)

Closure: if h1, h2 belong to H, h1 + h2 is also in H.

2. (B)

Associative h1 + (h2 + h3) = (h1 + h2) + h3 for all h1, h2, h3 in H

3. (C)

Identity element: there is a class 0 in H such that h + 0 = 0 + h = h for all h in H

$$\begin{array}{l}0+0=\left\{\ |\ \right\}+\left\{\ |\ \right\}=\left\{\ |\ \right\}=0\\ {}x+0=x+\left\{\ |\ \right\}=\left\{\ {X}_L+0\ |\ {X}_R+0\ \right\}=\left\{{X}_L|\ {X}_R\ \right\}=x\\ {}0+y=\left\{\ |\ \right\}+y=\left\{\ 0+{Y}_L\ |\ 0+{Y}_R\right\}=\left\{\ {Y}_L\ |\ {Y}_R\ \right\}=y\end{array}}$$
1. (D)

Inverse element: for each h in H, there is an element −h in H such that h + (−h) = (−h) + h = 0 see Fig. 11

1. (E)

Commutative h1 + h2 = h2 + h1 for all h1, h2 in H

Definition 4.2. The group under addition modulo (n)

We can create one to one function as shown in Table 2.

If we take Hn = {0, 1, 2,  … , n − 1}; 0 is the CO (class of) Zero games, 1 is the class of One games and so on. Let us define the operation :

for every h1, h2Hn;

$${h}_1\oplus {h}_2=\left\{\begin{array}{cc}{h}_1+{h}_2& {h}_1+{h}_2<n\\ {}{h}_1+{h}_2-n& {h}_1+{h}_2\ge n\end{array}\right.$$

It is clear from the definition that the operation is closure, associative, commutative, and has an identity element (0). For every element hHn there is an inverse element n − h, or −h = n − h. Therefore, Hn is a commutative group under addition modulo n. For example, H6 = {0, 1, 2, , 3, 4, 5} the group under addition modulo 6 is shown in Table 3.

The inverse of the element 1 is −1 = 6 − 1 = 5 and the inverse of 2 is −2 = 6 − 2 = 4

Example 4.1. This group (퐻2 × 퐻2, +) consists of two tuples with addition defined

element-by-element modulo 2. An addition to the group table is shown in Table 4.

What is special in Hackenbush’s group?

Hackenbush group (H) is an infinite commutative group that has an element (not the identity) when added to itself, we get the identity element, see Fig. 12.

Conclusion

In this research, we have utilized combinatorial mathematical algebraic operations and concepts, through the evaluation of a deduced group from a combinatorial game called Hackenbush game to define the unique Hackenbush group.

Now, what happens if we considered the multiplication’s operation on what we have analyzed above.

$$\begin{array}{l} xy=\left\{{X}_L,{X}_R\right\}\left\{{Y}_L,{Y}_R\right\}\\ {}=\left\{{X}_Ly+{xY}_L-{X}_L{Y}_L,{X}_Ry+{xY}_R-{X}_R{Y}_R\left|{X}_Ly+{xY}_R-{X}_L{Y}_R,{xY}_L+{X}_Ry-{X}_R{Y}_L\right.\right\}.\end{array}}$$

Or the division’s operation that is done in terms of reciprocal and multiplication

$$\frac{x}{y}=x\left(\frac{1}{y}\right);\frac{1}{y}=$$
$$=\left\{\begin{array}{c}0,\frac{1+\left({y}^R-y\right){\left(\frac{1}{y}\right)}^L}{y^R},\frac{1+\left({y}^L-y\right){\left(\frac{1}{y}\right)}^R}{y^L}\mid \\ {}\frac{1+\left({y}^L-y\right){\left(\frac{1}{y}\right)}^L}{y^L},\frac{1+\left({y}^R-y\right){\left(\frac{1}{y}\right)}^R}{y^R}\end{array}\right\}.$$

Would that lead to the creation of Rings, Fields, etc.… and would such research be applied to the world of Algebra? Only further research will tell how far Combinatorial Game Theory can go.

↑:

Up game

↓:

Down game

CO:

Class of

References

1. 1.

Kleiner, I.: The evolution of group theory: a brief survey. Math. Mag. 59, 195–215 (1986). https://doi.org/10.2307/2690312, ISSN 0025-570X, JSTOR 2690312

2. 2.

Smith, D.E.: History of modern mathematics, mathematical monographs no. 1 (1906)

3. 3.

Wussing, H.: The genesis of the abstract group concept, a contribution to the history of the origin of abstract group theory. Dover Publications, ISBN 978-0-486-45868-7, New York (2007)

4. 4.

W.B.V. Kandasamy, F. Smarandache, Groups as graphs, (2009), see the link: https://arxiv.org/ftp/arxiv/papers/0906/0906.5144.pdf

5. 5.

White, A.T.: Graphs of groups on surfaces: interactions and models. University of Rochester, New York (2001) Elsevier, first edition

6. 6.

Nowakowski, R.J. (ed.): Game of no chance III. Mathematical Sciences Research Institute Cambridge University Press, (2008).

7. 7.

Berlekamp, E.R., Conway, J.H., Guy, R.K.: In: Peters, A.K. (ed.) Winning ways for your mathematical plays, vol. 1, 2nd edn, Massachusetts (2001), https://annarchive.com/files/Winning%20Ways%20for%20Your%20Mathematical%20Plays%20V1.pdf

8. 8.

John, S., Ryals, J.R.: Combinatorial game theory: an introduction to tree topplers, thesis under the direction of Hua Wang. Georgia Southern University, USA (2015)

9. 9.

Bouton, C.L.: Nim, a game with a complete mathematical theory. Ann. Math. 3, 35–39 (1902)

10. 10.

Conway, J.H.: Review: on numbers and games. Math. Soc. 84(6), 1328–1336 (1978)

11. 11.

McKay, N.A., Milley, R., Nowakowski, R.J.: Misère -play hackenbush sprigs. Int. J. Game Theory. 45, 731–742 (2015)

12. 12.

Siegel, A.N.: Coping with cycles. In: Games of no chance III. Cambridge University (2009), http://www.msri.org/people/staff/levy/files/Book56/12siegel.pdf

13. 13.

Berlekamp, E.R.: The hackenbush number system for compression of numerical data. Inf. Control. 26, 134–140 (1974)

14. 14.

Fraenkel, A.: A brief biography. Electron. J. Comb, 8 (2001)

15. 15.

Albert, M., Nowakowski, R., Wolfe, D.: Lessons in play: an introduction to combinatorial game theory, CRC (2007)

Acknowledgements

The authors are very thankful to the editor.

Not applicable.

Not applicable.

Author information

All authors jointly worked on the results and they read and approved the final manuscript.

Correspondence to Awad Alabdala.

Ethics declarations

Competing interests

The authors declare that they have no competing interests.

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions 