Skip to main content
a minor typo
Source Link
Martin Sleziak
  • 4.7k
  • 4
  • 35
  • 40

Peg solitaire which I played on chess board in childhood. Let me explain this solitary game; consider the following table consisted of 33 holes.

There is a peg in all except one of the holes.(Assume that one is in the center). You can move a peg horizontally and vertically. The permissible move consists of jumping one peg over another into an empty hole and simultaneously removing the peg has been jumped over. One can continue this process to reach a situation than cannot have an acceptable move. And the player is winner if the last situation has only one peg.

Thus we can ask some question:

  1. Does this play has a winning strategy?

  2. What are the possible last situations?

enter image description here

The interesting point is the analysis of this game relates to the finite field with 4 elements, GF(4). The answer to question 1 is yes. For question 2 please consult the papaerpaper "A solitaire game and its relation to a finite field" by N. G. de Bruijin.

It seems the result of the paper can be extended. I think it is useful in a course in algebra, I exposed the paper when I was a TA in algebra 2.

Peg solitaire which I played on chess board in childhood. Let me explain this solitary game; consider the following table consisted of 33 holes.

There is a peg in all except one of the holes.(Assume that one is in the center). You can move a peg horizontally and vertically. The permissible move consists of jumping one peg over another into an empty hole and simultaneously removing the peg has been jumped over. One can continue this process to reach a situation than cannot have an acceptable move. And the player is winner if the last situation has only one peg.

Thus we can ask some question:

  1. Does this play has a winning strategy?

  2. What are the possible last situations?

enter image description here

The interesting point is the analysis of this game relates to the finite field with 4 elements, GF(4). The answer to question 1 is yes. For question 2 please consult the papaer "A solitaire game and its relation to a finite field" by N. G. de Bruijin.

It seems the result of the paper can be extended. I think it is useful in a course in algebra, I exposed the paper when I was a TA in algebra 2.

Peg solitaire which I played on chess board in childhood. Let me explain this solitary game; consider the following table consisted of 33 holes.

There is a peg in all except one of the holes.(Assume that one is in the center). You can move a peg horizontally and vertically. The permissible move consists of jumping one peg over another into an empty hole and simultaneously removing the peg has been jumped over. One can continue this process to reach a situation than cannot have an acceptable move. And the player is winner if the last situation has only one peg.

Thus we can ask some question:

  1. Does this play has a winning strategy?

  2. What are the possible last situations?

enter image description here

The interesting point is the analysis of this game relates to the finite field with 4 elements, GF(4). The answer to question 1 is yes. For question 2 please consult the paper "A solitaire game and its relation to a finite field" by N. G. de Bruijin.

It seems the result of the paper can be extended. I think it is useful in a course in algebra, I exposed the paper when I was a TA in algebra 2.

added 6 characters in body
Source Link
Rahman. M
  • 2.4k
  • 2
  • 24
  • 42

Peg solitaire which I played on chasechess board in childhood. Let me explain this solitary game; consider the following table consisted of 33 holes.

There is a peg in all except one of the holes.(Assume that one is in the center). You can move a peg horizontally and vertically. The permissible move consists of jumping one peg over another into an empty hole and simultaneously removing the peg has been jumped over. One can continue this process to reach a situation than cannot have an acceptable move. And athe player is winner if the last situation has only one peg.

Thus we can ask some question:

  1. Does this play has a winning strategy?

    Does this play has a winning strategy?

  2. What are the possible last situations?

2)What are the possible last situations?

enter image description here

The interesting point is the analysis of this game relates to the finite field with 4 elements, GF(4). The answer to question 1 is yes. For question 2 please consult the papaer "A solitaire game and its relation to a finite field" by N. G. de Bruijin.

It seems the result of the paper can be extended. I think it is useful in a course in algebra, I exposed the paper when I was a TA in algebra 2.

Peg solitaire which I played on chase board in childhood. Let me explain this solitary game; consider the following table consisted of 33 holes.

There is a peg in all except one of the holes.(Assume that one in the center). You can move a peg horizontally and vertically. The permissible move consists of jumping one peg over another into an empty hole and simultaneously removing the peg has been jumped over. One can continue this process to reach a situation than cannot have an acceptable move. And a player is winner if the last situation has only one peg.

Thus we can ask some question:

  1. Does this play has a winning strategy?

2)What are the possible last situations?

enter image description here

The interesting point is the analysis of this game relates to the finite field with 4 elements, GF(4). The answer to question 1 is yes. For question 2 please consult the papaer "A solitaire game and its relation to a finite field" by N. G. de Bruijin.

It seems the result of the paper can be extended. I think it is useful in a course in algebra, I exposed the paper when I was a TA in algebra 2.

Peg solitaire which I played on chess board in childhood. Let me explain this solitary game; consider the following table consisted of 33 holes.

There is a peg in all except one of the holes.(Assume that one is in the center). You can move a peg horizontally and vertically. The permissible move consists of jumping one peg over another into an empty hole and simultaneously removing the peg has been jumped over. One can continue this process to reach a situation than cannot have an acceptable move. And the player is winner if the last situation has only one peg.

Thus we can ask some question:

  1. Does this play has a winning strategy?

  2. What are the possible last situations?

enter image description here

The interesting point is the analysis of this game relates to the finite field with 4 elements, GF(4). The answer to question 1 is yes. For question 2 please consult the papaer "A solitaire game and its relation to a finite field" by N. G. de Bruijin.

It seems the result of the paper can be extended. I think it is useful in a course in algebra, I exposed the paper when I was a TA in algebra 2.

Source Link
Rahman. M
  • 2.4k
  • 2
  • 24
  • 42

Peg solitaire which I played on chase board in childhood. Let me explain this solitary game; consider the following table consisted of 33 holes.

There is a peg in all except one of the holes.(Assume that one in the center). You can move a peg horizontally and vertically. The permissible move consists of jumping one peg over another into an empty hole and simultaneously removing the peg has been jumped over. One can continue this process to reach a situation than cannot have an acceptable move. And a player is winner if the last situation has only one peg.

Thus we can ask some question:

  1. Does this play has a winning strategy?

2)What are the possible last situations?

enter image description here

The interesting point is the analysis of this game relates to the finite field with 4 elements, GF(4). The answer to question 1 is yes. For question 2 please consult the papaer "A solitaire game and its relation to a finite field" by N. G. de Bruijin.

It seems the result of the paper can be extended. I think it is useful in a course in algebra, I exposed the paper when I was a TA in algebra 2.

Post Made Community Wiki by Rahman. M