Skip to content

This is the solver of pseudo EternityII. The comments in the codes are written in Japanese.

Notifications You must be signed in to change notification settings

beginaid/EternityII

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

11 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

EternityII


This is the solver of pseudo EternityII. The comments in the codes are written in Japanese.

Description

In this system, we considered EternityII as simpler one, and call it "Pseudo EternityII". Originally, EternityII is a puzzle competition which was released on 28 July 2007. Tow million dollars are put on the puzzle, but no one can solve the puzzle. EternityII puzzle is an "edge-matching puzzle" which includes 256 square puzzle pieces and places them into a 16 by 16 grid. Then players must match adjacent edges. This puzzle is too difficult and time-consuming to solve with a laptop. Therefore, I introduced the easier version named Pseudo EternityII. The requirements of Pseudo EternityII are listed below.


  • The grid size is controllable.
  • The kinds of inner colors are controllable.
  • The pieces cannot be rotated.
  • The middle piece is placed from the beginning.

In addition, to make the puzzle simpler, the grid size is set as an odd number. This is because if the grid size is an odd number, the middle piece is defined uniquely.


The main contents are divided into two types.


  1. Drawing EternityII
  2. Solving EternityII

To our knowledge, we have tried to visualize EternityII for the first time. Drawing EternityII, we can tackle the puzzle from visualizetion and catch the missed pieces qualitatively.


Usage

Drawing

$ python drawing.py [the number of the girds side] [the number of colors]

Arguments:

  1. The number of grids side. If you choose 3, 9 pieces are created.
  2. The number of colors you can use to the puzzle.

Return:

  • An answer to the puzzle (answer.png)
  • A shuffled puzzle (input.png)

Note:

  • If you choose too many colors, the message like "Please set the different number of colors. Anyway, we'll make the puzzle using hogehoge colors." is appeared.

Solving

$ python solver.py [the number of the girds side] [the number of colors]

Arguments:

  1. The number of grids side. If you choose 3, 9 pieces are created.
  2. The number of colors you can use to the puzzle.

Return:

  • Solved pieces of the puzzle through the solver (output.png)

Standard Output:

  • An accuracy rate of the edges.

Note:

  • If you choose too many colors, the message like "Please set the different number of colors. Anyway, we'll make the puzzle using hogehoge colors." is appeared.
  • This solver does not do backprop. Therefore, in some cases, the accuracy rate cannot reach 100%.

About

This is the solver of pseudo EternityII. The comments in the codes are written in Japanese.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages