Zeszyty czasopisma

Tom 10 (2023): Zeszyt 17 (January 2023)

Tom 9 (2022): Zeszyt 16 (June 2022)

Tom 8 (2021): Zeszyt 15 (November 2021)

Tom 8 (2021): Zeszyt 14 (October 2021)

Tom 7 (2020): Zeszyt 13 (November 2020)

Tom 6 (2019): Zeszyt 12 (December 2019)

Tom 6 (2019): Zeszyt 11 (September 2019)

Tom 5 (2018): Zeszyt 10 (December 2018)

Tom 5 (2018): Zeszyt 9 (September 2018)

Tom 4 (2017): Zeszyt 8 (December 2017)

Tom 4 (2017): Zeszyt 7 (May 2017)

Tom 3 (2016): Zeszyt 6 (December 2016)

Tom 3 (2016): Zeszyt 5 (March 2016)

Informacje o czasopiśmie
Format
Czasopismo
eISSN
2182-1976
Pierwsze wydanie
16 Apr 2016
Częstotliwość wydawania
2 razy w roku
Języki
Angielski

Wyszukiwanie

Tom 4 (2017): Zeszyt 7 (May 2017)

Informacje o czasopiśmie
Format
Czasopismo
eISSN
2182-1976
Pierwsze wydanie
16 Apr 2016
Częstotliwość wydawania
2 razy w roku
Języki
Angielski

Wyszukiwanie

6 Artykułów

Games and Puzzles

Otwarty dostęp

Several Bounds for the K-Tower of Hanoi Puzzle

Data publikacji: 09 Jun 2017
Zakres stron: 79 - 118

Abstrakt

Abstract

We consider special cases of a modified version of the Tower of Hanoi puzzle and demonstrate how to find upper bounds on the minimum number of moves that it takes to complete these cases.

Słowa kluczowe

  • Tower of Hanoi Puzzle
  • minimum number of moves
Otwarty dostęp

Eternal Picaria

Data publikacji: 09 Jun 2017
Zakres stron: 119 - 133

Abstrakt

Abstract

Picaria is a traditional board game, played by the Zuni tribe of the American Southwest and other parts of the world, such as a rural Southwest region in Sweden. It is related to the popular children’s game of Tic-tac-toe, but the 2 players have only 3 stones each, and in the second phase of the game, pieces are slided, along specified move edges, in attempts to create the three-in-a-row. We provide a rigorous solution, and prove that the game is a draw; moreover our solution gives insights to strategies that players can use.

Słowa kluczowe

  • Abstract strategy game
  • Alignment game
  • Board game
  • Cyclic game
  • Loopy game
  • Luffarschack
  • Play-proof
  • Tapatan
  • Three-in-a-row
  • Three men’s morris
  • Zuni tribe
Otwarty dostęp

Exploring the “Rubik's Magic” Universe

Data publikacji: 09 Jun 2017
Zakres stron: 29 - 64

Abstrakt

Abstract

By using two different invariants for the Rubik’s Magic puzzle, one of metric type, the other of topological type, we can dramatically reduce the universe of constructible configurations of the puzzle. Finding the set of actually constructible shapes remains however a challenging task, that we tackle by first reducing the target shapes to specific configurations: the octominoid 3D shapes, with all tiles parallel to one coordinate plane; and the planar “face-up” shapes, with all tiles (considered of infinitesimal width) lying in a common plane and without superposed consecutive tiles. There are still plenty of interesting configurations that do not belong to either of these two collections. The set of constructible configurations (those that can be obtained by manipulation of the undecorated puzzle from the starting situation) is a subset of the set of configurations with vanishing invariants. We were able to actually construct all octominoid shapes with vanishing invariants and most of the planar “face-up” configurations. Particularly important is the topological invariant, of which we recently found mention in [7] by Tom Verhoeff.

Słowa kluczowe

  • Rubik's Magic puzzle
  • octominoid 3D shapes
  • topological invariants
Otwarty dostęp

Designing Peg Solitaire Puzzles

Data publikacji: 09 Jun 2017
Zakres stron: 5 - 19

Abstrakt

Abstract

Peg solitaire is an old puzzle with a 300 year history. We consider two ways a computer can be utilized to find interesting peg solitaire puzzles. It is common for a peg solitaire puzzle to begin from a symmetric board position, we have computed solvable symmetric board positions for four board shapes. A new idea is to search for board positions which have a unique starting jump leading to a solution. We show many challenging puzzles uncovered by this search technique. Clever solvers can take advantage of the uniqueness property to help solve these puzzles.

Słowa kluczowe

  • Solitaire puzzles
  • game design

Articles

Otwarty dostęp

Demystifying Benjamin Franklin’s Other 8-Square

Data publikacji: 09 Jun 2017
Zakres stron: 21 - 27

Abstrakt

Abstract

In this article, we reveal how Benjamin Franklin constructed his second 8 × 8 magic square. We also construct two new 8 × 8 Franklin squares

Słowa kluczowe

  • Magic squares
  • Benjamin Franklin’s 8-squares

Mathmagic

Otwarty dostęp

On a Mathematical Model for an Old Card Trick

Data publikacji: 09 Jun 2017
Zakres stron: 65 - 77

Abstrakt

Abstract

The three-pile trick is a well-known card trick performed with a deck of 27 cards which dates back to the early seventeenth century at least and its objective is to uncover the card chosen by a volunteer. The main purpose of this research is to give a mathematical generalization of the three-pile trick for any deck of ab cards with a, b ≥ 2 any integers by means of a finite family of simple discrete functions. Then, it is proved each of these functions has just one or two stable fixed points. Based on this findings a list of 222 (three-pile trick)-type brand new card tricks was generated for either a package of 52 playing cards or any appropriate portion of it with a number of piles between 3 and 7. It is worth noting that all the card tricks on the list share the three main properties that have characterized the three-pile trick: simplicity, self-performing and infallibility. Finally, a general performing protocol, useful for magicians, is given for all the cases. All the employed math techniques involve naive theory of discrete functions, basic properties of the quotient and remainder of the division of integers and modular arithmetic.

Słowa kluczowe

  • Modular arithmetic
  • fixed point theory of discrete functions
  • three-pile trick
6 Artykułów

Games and Puzzles

Otwarty dostęp

Several Bounds for the K-Tower of Hanoi Puzzle

Data publikacji: 09 Jun 2017
Zakres stron: 79 - 118

Abstrakt

Abstract

We consider special cases of a modified version of the Tower of Hanoi puzzle and demonstrate how to find upper bounds on the minimum number of moves that it takes to complete these cases.

Słowa kluczowe

  • Tower of Hanoi Puzzle
  • minimum number of moves
Otwarty dostęp

Eternal Picaria

Data publikacji: 09 Jun 2017
Zakres stron: 119 - 133

Abstrakt

Abstract

Picaria is a traditional board game, played by the Zuni tribe of the American Southwest and other parts of the world, such as a rural Southwest region in Sweden. It is related to the popular children’s game of Tic-tac-toe, but the 2 players have only 3 stones each, and in the second phase of the game, pieces are slided, along specified move edges, in attempts to create the three-in-a-row. We provide a rigorous solution, and prove that the game is a draw; moreover our solution gives insights to strategies that players can use.

Słowa kluczowe

  • Abstract strategy game
  • Alignment game
  • Board game
  • Cyclic game
  • Loopy game
  • Luffarschack
  • Play-proof
  • Tapatan
  • Three-in-a-row
  • Three men’s morris
  • Zuni tribe
Otwarty dostęp

Exploring the “Rubik's Magic” Universe

Data publikacji: 09 Jun 2017
Zakres stron: 29 - 64

Abstrakt

Abstract

By using two different invariants for the Rubik’s Magic puzzle, one of metric type, the other of topological type, we can dramatically reduce the universe of constructible configurations of the puzzle. Finding the set of actually constructible shapes remains however a challenging task, that we tackle by first reducing the target shapes to specific configurations: the octominoid 3D shapes, with all tiles parallel to one coordinate plane; and the planar “face-up” shapes, with all tiles (considered of infinitesimal width) lying in a common plane and without superposed consecutive tiles. There are still plenty of interesting configurations that do not belong to either of these two collections. The set of constructible configurations (those that can be obtained by manipulation of the undecorated puzzle from the starting situation) is a subset of the set of configurations with vanishing invariants. We were able to actually construct all octominoid shapes with vanishing invariants and most of the planar “face-up” configurations. Particularly important is the topological invariant, of which we recently found mention in [7] by Tom Verhoeff.

Słowa kluczowe

  • Rubik's Magic puzzle
  • octominoid 3D shapes
  • topological invariants
Otwarty dostęp

Designing Peg Solitaire Puzzles

Data publikacji: 09 Jun 2017
Zakres stron: 5 - 19

Abstrakt

Abstract

Peg solitaire is an old puzzle with a 300 year history. We consider two ways a computer can be utilized to find interesting peg solitaire puzzles. It is common for a peg solitaire puzzle to begin from a symmetric board position, we have computed solvable symmetric board positions for four board shapes. A new idea is to search for board positions which have a unique starting jump leading to a solution. We show many challenging puzzles uncovered by this search technique. Clever solvers can take advantage of the uniqueness property to help solve these puzzles.

Słowa kluczowe

  • Solitaire puzzles
  • game design

Articles

Otwarty dostęp

Demystifying Benjamin Franklin’s Other 8-Square

Data publikacji: 09 Jun 2017
Zakres stron: 21 - 27

Abstrakt

Abstract

In this article, we reveal how Benjamin Franklin constructed his second 8 × 8 magic square. We also construct two new 8 × 8 Franklin squares

Słowa kluczowe

  • Magic squares
  • Benjamin Franklin’s 8-squares

Mathmagic

Otwarty dostęp

On a Mathematical Model for an Old Card Trick

Data publikacji: 09 Jun 2017
Zakres stron: 65 - 77

Abstrakt

Abstract

The three-pile trick is a well-known card trick performed with a deck of 27 cards which dates back to the early seventeenth century at least and its objective is to uncover the card chosen by a volunteer. The main purpose of this research is to give a mathematical generalization of the three-pile trick for any deck of ab cards with a, b ≥ 2 any integers by means of a finite family of simple discrete functions. Then, it is proved each of these functions has just one or two stable fixed points. Based on this findings a list of 222 (three-pile trick)-type brand new card tricks was generated for either a package of 52 playing cards or any appropriate portion of it with a number of piles between 3 and 7. It is worth noting that all the card tricks on the list share the three main properties that have characterized the three-pile trick: simplicity, self-performing and infallibility. Finally, a general performing protocol, useful for magicians, is given for all the cases. All the employed math techniques involve naive theory of discrete functions, basic properties of the quotient and remainder of the division of integers and modular arithmetic.

Słowa kluczowe

  • Modular arithmetic
  • fixed point theory of discrete functions
  • three-pile trick

Zaplanuj zdalną konferencję ze Sciendo