0%

Problem 96


Problem 96


Su Doku

Su Doku (Japanese meaning number place) is the name given to a popular puzzle concept. Its origin is unclear, but credit must be attributed to Leonhard Euler who invented a similar, and much more difficult, puzzle idea called Latin Squares. The objective of Su Doku puzzles, however, is to replace the blanks (or zeros) in a 9 by 9 grid in such that each row, column, and 3 by 3 box contains each of the digits 1 to 9. Below is an example of a typical starting puzzle grid and its solution grid.

             
0 0 3 0 2 0 6 0 0 * 4 8 3 9 6 7 2 5 1
9 0 0 3 0 5 0 0 1 * 9 2 1 3 4 5 8 7 6
0 0 1 8 0 6 4 0 0 * 6 5 7 8 2 1 4 9 3
0 0 8 1 0 2 9 0 0 * 5 4 8 7 2 9 1 3 6
7 0 0 0 0 0 0 0 8 * 1 3 2 5 6 4 7 9 8
0 0 6 7 0 8 2 0 0 * 9 7 6 1 3 8 2 4 5
0 0 2 6 0 9 5 0 0 * 3 7 2 8 1 4 6 9 5
8 0 0 2 0 3 0 0 9 * 6 8 9 2 5 3 4 1 7
0 0 5 0 1 0 3 0 0 * 5 1 4 7 6 9 3 8 2

A well constructed Su Doku puzzle has a unique solution and can be solved by logic, although it may be necessary to employ “guess and test” methods in order to eliminate options (there is much contested opinion over this). The complexity of the search determines the difficulty of the puzzle; the example above is considered easy because it can be solved by straight forward direct deduction.

The 6K text file, sudoku.txt(right click and ‘Save Link/Target As…’), contains fifty different Su Doku puzzles ranging in difficulty, but all with unique solutions (the first puzzle in the file is the example above).

By solving all fifty puzzles find the sum of the 3-digit numbers found in the top left corner of each solution grid; for example, 483 is the 3-digit number found in the top left corner of the solution grid above.


数独

数独(日语原意为数的位置)是一种热门的谜题。它的起源已不可考,但是与欧拉发明的一种类似而更加困难的谜题拉丁方阵之间有着千丝万缕的联系。数独的目标是替换掉9乘9网格中的空白位置(或0),使得每行、每列以及每个九宫格中恰好都包含数字1~9。如下是一个典型的数独谜题以及它的解答。

             
0 0 3 0 2 0 6 0 0 * 4 8 3 9 6 7 2 5 1
9 0 0 3 0 5 0 0 1 * 9 2 1 3 4 5 8 7 6
0 0 1 8 0 6 4 0 0 * 6 5 7 8 2 1 4 9 3
0 0 8 1 0 2 9 0 0 * 5 4 8 7 2 9 1 3 6
7 0 0 0 0 0 0 0 8 * 1 3 2 5 6 4 7 9 8
0 0 6 7 0 8 2 0 0 * 9 7 6 1 3 8 2 4 5
0 0 2 6 0 9 5 0 0 * 3 7 2 8 1 4 6 9 5
8 0 0 2 0 3 0 0 9 * 6 8 9 2 5 3 4 1 7
0 0 5 0 1 0 3 0 0 * 5 1 4 7 6 9 3 8 2

一个构造精良的数独谜题应该包含有唯一解,且能够通过逻辑推断来解决,尽管有时可能必须通过“猜测并检验”来排除一些选项(这一要求目前还颇受争议)。寻找答案的复杂度决定了题目的难度;上面这个谜题被认为是简单的谜题,因为我们可以通过直截了当的演绎推理来解决它。

在这个6K的文本文件sudoku.txt(右击并选择“目标另存为……”)中包含有50个不同难度的数独谜题,但保证它们都只有唯一解(文件中的第一个谜题就是上述样例)。

解开这50个谜题,找出每个谜题解答左上角的三个数字并连接起来,给出这些数的和;举例来说,上述样例解答左上角的三个数字连接起来构成的数是483。