|
Takuzu is a logic-based number placement puzzle. The objective is to fill a (usually 10×10) 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. Takuzu is distributed in the French publications ''Le Figaro'', ''Ludojeux''. and 20 Minutes〔(【引用サイトリンク】url=http://www.20minutes.fr/services/takuzu )〕 File:Takuzu solved grid.svg|The same grid, solved ==Solving methods== * Each row and each column should contain an equal number of 0s and 1s. If the required number of 0s or 1s is reached in a row or a column, the remaining cells should contain the other number. (1xx101 - 100101) * More than two same number can't be adjacent. If two adjacent cells contain the same number, the cells next to the numbers should contains the other number.(xxx00x - xx1001) If two cells contain the same number with an empty cell between, this empty cell should contain the other number because otherwise three same number appears. (x1x1xx - x101xx) * Each row and column is unique. (100101 1001xx - 100101 100110) * Eliminate impossible combinations. For example 110xxx, the cell n°6 should contain 0 because otherwise a trio appears (110xx1 - 110001) 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Takuzu」の詳細全文を読む スポンサード リンク
|