Takuzu

Last updated

Takuzu, also known as Binairo, is a logic puzzle involving placement of two symbols, often 1s and 0s, on a rectangular grid. The objective is to fill the grid with 1s and 0s, where there is an equal number of 1s and 0s in each row and column and no more than two of either number adjacent to each other. Additionally, there can be no identical rows or columns. Similar to Sudoku, each puzzle begins with several squares in the grid already filled.

Contents

Names and variations

The game is known as Binairo, Takuzu, Binero, [1] [2] Tohu-Wa-Vohu (Formless and Empty), Eins und Zwei (One and Two), Binary Puzzles, Binoxxo, Zernero, [3] Tic-Tac-Logic, [4] and Sudoku Binary. [5] The names "Binairo" and "Takuzu" are trademarked in the European Union. [6] [7] The name "Binero" is trademarked in France by Editions Megastar. [8]

Certain names imply specific symbols being used. For example, Binary Puzzles use 1s and 0s (i.e. binary numbers), Tic-Tac-Logic uses Xs and Os (like tic-tac-toe), Eins und Zwei uses 1s and 2s, and Tohu-Wa-Vohu uses T and V symbols. However, many of the names are used for any variation of symbols. Black and white circles (or squares) are another commonly used pair of symbols. Any variation of two numbers, letters, colors, or pictures can work as the two symbols, though it is generally common for the symbols to be 1s, Xs, or shapes.

The rectangular grid sizes can vary greatly. Since the objective is to have equal number of both symbols in each row and column, the number of rows and columns is normally even. Though not required, grids are often square. Common sizes range from 4x4 to 20x20. [9] [10] Larger puzzles are also made, including ones that use a 30x40 grid. [11]

Some variations allow identical rows and columns. [3] Another variation, Odd Binairo, has an odd number of rows and columns with each containing one more 1 than 0s (i.e. in a 11x11 grid, each row and column has 5 zeros and 6 ones). [12]

History

There are two competing origins to the puzzle, both created around the same time. Tohu wa Vohu was invented by Italian Adolfo Zanellati. [3] Binairo was created by Belgians Peter De Schepper and Frank Coussement in 2009. [1] [12]

Tic-Tac-Logic claims its origin on creating a single-player version of tic-tac-toe. Like tic-tac-toe, it uses Xs and Os. The two-player game's goal is to create three in a row, while in Tic-Tac-Logic, the goal is to prevent any three in a row. [4]

Solving methods

Mathematics

A zero-knowledge proof for the puzzle was published in Jun 2016. [13] [14]

The puzzle was adapted for modeling quantum agents. [15]

Mathematicians of Dutch university (PH Utomo and RH Makarim) proposed three different approaches to solve binary puzzles: using backtrack-based search, SAT solvers, and Gröbner bases algorithms. [16] The last two approaches reduce the problem of solving a binary puzzle to a Boolean satisfiability problem and solving systems of polynomial equations over the binary field.

Related Research Articles

<span class="mw-page-title-main">Tic-tac-toe</span> Paper-and-pencil game for two players

Tic-tac-toe, noughts and crosses, or Xs and Os is a paper-and-pencil game for two players who take turns marking the spaces in a three-by-three grid with X or O. The player who succeeds in placing three of their marks in a horizontal, vertical, or diagonal row is the winner. It is a solved game, with a forced draw assuming best play from both players.

<span class="mw-page-title-main">Nonogram</span> Logic puzzle forming a picture in a grid

Nonograms, also known as Hanjie, Paint by Numbers, Picross, Griddlers, and Pic-a-Pix are picture logic puzzles in which cells in a grid must be colored or left blank according to numbers at the edges of the grid to reveal a hidden picture. In this puzzle, the numbers are a form of discrete tomography that measures how many unbroken lines of filled-in squares there are in any given row or column. For example, a clue of "4 8 3" would mean there are sets of four, eight, and three filled squares, in that order, with at least one blank square between successive sets.

Verbal arithmetic, also known as alphametics, cryptarithmetic, cryptarithm or word addition, is a type of mathematical game consisting of a mathematical equation among unknown numbers, whose digits are represented by letters of the alphabet. The goal is to identify the value of each letter. The name can be extended to puzzles that use non-alphabetic symbols instead of letters.

<span class="mw-page-title-main">Kakuro</span> Type of logic puzzle

Kakuro or Kakkuro or Kakoro is a kind of logic puzzle that is often referred to as a mathematical transliteration of the crossword. Kakuro puzzles are regular features in many math-and-logic puzzle publications across the world. In 1966, Canadian Jacob E. Funk, an employee of Dell Magazines, came up with the original English name Cross Sums and other names such as Cross Addition have also been used, but the Japanese name Kakuro, abbreviation of Japanese kasan kurosu, seems to have gained general acceptance and the puzzles appear to be titled this way now in most publications. The popularity of Kakuro in Japan is immense, second only to Sudoku among Nikoli's famed logic-puzzle offerings.

<span class="mw-page-title-main">Sudoku</span> Logic-based number-placement puzzle

Sudoku is a logic-based, combinatorial number-placement puzzle. In classic Sudoku, the objective is to fill a 9 × 9 grid with digits so that each column, each row, and each of the nine 3 × 3 subgrids that compose the grid contains all of the digits from 1 to 9. The puzzle setter provides a partially completed grid, which for a well-posed puzzle has a single solution.

<span class="mw-page-title-main">Hitori</span>

Hitori is a type of logic puzzle published by Nikoli.

<span class="mw-page-title-main">Slitherlink</span> Logic puzzle

Slitherlink is a logic puzzle developed by publisher Nikoli.

<span class="mw-page-title-main">Mathematics of Sudoku</span> Mathematical investigation of Sudoku

Mathematics can be used to study Sudoku puzzles to answer questions such as "How many filled Sudoku grids are there?", "What is the minimal number of clues in a valid puzzle?" and "In what ways can Sudoku grids be symmetric?" through the use of combinatorics and group theory.

<span class="mw-page-title-main">Killer sudoku</span> Arithmetical puzzle game

Killer sudoku is a puzzle that combines elements of sudoku and kakuro. Despite the name, the simpler killer sudokus can be easier to solve than regular sudokus, depending on the solver's skill at mental arithmetic; the hardest ones, however, can take hours to solve.

<span class="mw-page-title-main">Glossary of Sudoku</span>

This is a glossary of Sudoku terms and jargon. It is organized thematically, with links to references and example usage provided as ([1]). Sudoku with a 9×9 grid is assumed, unless otherwise noted.

<i>Inshi no heya</i> Logic puzzle

Inshi no heya is a type of logic puzzle published by Nikoli. It is a specific form of the KenKen puzzle genre where every operation is implied to be multiplication.

<span class="mw-page-title-main">Futoshiki</span> Logic puzzle game

Futoshiki, or More or Less, is a logic puzzle game from Japan. Its name means "inequality". It is also spelled hutosiki. Futoshiki was developed by Tamaki Seto in 2001.

<span class="mw-page-title-main">Sudoku solving algorithms</span> Algorithms to complete a sudoku

A standard Sudoku contains 81 cells, in a 9×9 grid, and has 9 boxes, each box being the intersection of the first, middle, or last 3 rows, and the first, middle, or last 3 columns. Each cell may contain a number from one to nine, and each number can only occur once in each row, column, and box. A Sudoku starts with some cells containing numbers (clues), and the goal is to solve the remaining cells. Proper Sudokus have one solution. Players and investigators use a wide range of computer algorithms to solve Sudokus, study their properties, and make new puzzles, including Sudokus with interesting symmetries and other properties.

A Survo puzzle is a kind of logic puzzle presented and studied by Seppo Mustonen. The name of the puzzle is associated with Mustonen's Survo system, which is a general environment for statistical computing and related areas.

<span class="mw-page-title-main">KenKen</span> Logic-based number-placement puzzle

KenKen and KenDoku are trademarked names for a style of arithmetic and logic puzzle invented in 2004 by Japanese math teacher Tetsuya Miyamoto, who intended the puzzles to be an instruction-free method of training the brain. The name derives from the Japanese word for cleverness. The names Calcudoku and Mathdoku are sometimes used by those who do not have the rights to use the KenKen or KenDoku trademarks.

<span class="mw-page-title-main">Hidato</span> Logic puzzle

Hidato, also known as "Hidoku", is a logic puzzle game invented by Dr. Gyora M. Benedek, an Israeli mathematician. The goal of Hidato is to fill the grid with consecutive numbers that connect horizontally, vertically, or diagonally. The name Hidato is a registered trademark. Some publishers use different names for this puzzle such as Number Snake, Snakepit, Jadium or Numbrix.

<span class="mw-page-title-main">Str8ts</span> Logic puzzle

Str8ts is a logic-based number-placement puzzle, invented by Jeff Widderich in 2008. It is distinct from, but shares some properties and rules with Sudoku. The name is derived from the poker straight. The puzzle is published in a number of newspapers internationally, in two book collections, and in downloadable apps. It was featured on the Canadian television show Dragons' Den on November 24, 2010.

Sudoku codes are non-linear forward error correcting codes following rules of sudoku puzzles designed for an erasure channel. Based on this model, the transmitter sends a sequence of all symbols of a solved sudoku. The receiver either receives a symbol correctly or an erasure symbol to indicate that the symbol was not received. The decoder gets a matrix with missing entries and uses the constraints of sudoku puzzles to reconstruct a limited amount of erased symbols.

<span class="mw-page-title-main">Tic-tac-toe variants</span> Overview about tic-tac-toe variants

Tic-tac-toe is an instance of an m,n,k-game, where two players alternate taking turns on an m×n board until one of them gets k in a row. Harary's generalized tic-tac-toe is an even broader generalization. The game can also be generalized as a nd game. The game can be generalised even further from the above variants by playing on an arbitrary hypergraph where rows are hyperedges and cells are vertices.

<span class="mw-page-title-main">Sudoku graph</span> Mathematical graph of a Sudoku

In the mathematics of Sudoku, the Sudoku graph is an undirected graph whose vertices represent the cells of a (blank) Sudoku puzzle and whose edges represent pairs of cells that belong to the same row, column, or block of the puzzle. The problem of solving a Sudoku puzzle can be represented as precoloring extension on this graph. It is an integral Cayley graph.

References

  1. 1 2 Aberkane, Idriss J. (18 July 2016). "Comment le Binairo stimule les neurones !" [How Binairo stimulates neurons!]. Le Point (in French). Retrieved 9 February 2019.
  2. Cusset, Maïlys (23 June 2016). "Binairo, le jeu pour les accros des chiffres" [Binairo, the game for number addicts]. Biba  [ fr ] (in French). Retrieved 9 February 2019.
  3. 1 2 3 "Tohu-Wa-Vohu". janko.at (in German). Retrieved 9 February 2019.
  4. 1 2 "Tic-Tac-Logic history". Conceptis Puzzles. Retrieved 9 February 2019.
  5. "Sudoku Binary - Google Search". www.google.com.
  6. "EUTM file information - Binairo". EUIPO . Retrieved 9 February 2019.
  7. "EUTM file information - Takuzu". EUIPO . Retrieved 9 February 2019.
  8. "BINERO RELAX (Marques) - Data INPI". data.inpi.fr.
  9. "Binairo". Binairo. Puzzle Team. Retrieved 9 February 2019.
  10. "Binary Puzzle". BinaryPuzzle.com. Retrieved 9 February 2019.
  11. "Special Monthly Binairo". Binairo. Puzzle Team. Retrieved 9 February 2019.
  12. 1 2 "Even and Odd Binairo". PeterFrank. Retrieved 9 February 2019.
  13. Bultel, Xavier; Dreier, Jannik; Dumas, Jean-Guillaume; Lafourcade, Pascal (2016). "Physical Zero-Knowledge Proofs for Akari, Takuzu, Kakuro and KenKen". arXiv: 1606.01045 [cs.CR].
  14. Xavier Bultel, Jannik Dreier, Jean-Guillaume Dumas, and Pascal Lafourcade4. "Physical Zero-Knowledge Proofs for Akari, Takuzu, Kakuro and KenKen" (PDF).{{cite web}}: CS1 maint: multiple names: authors list (link) CS1 maint: numeric names: authors list (link)
  15. Fougères, Alain-Jérôme (2017). "Agent Having Quantum Properties: The Superposition States and the Entanglement". Computational Collective Intelligence. Lecture Notes in Computer Science. Vol. 10448. pp. 389–398. doi:10.1007/978-3-319-67074-4_38. ISBN   978-3-319-67073-7.
  16. Utomo, Putranto H.; Makarim, Rusydi H. (2017). "Solving a Binary Puzzle". Mathematics in Computer Science. 11 (3–4): 515–526. doi: 10.1007/s11786-017-0322-4 .