2009 Google U.S. Puzzle Championship! 題型中譯

請原諒小弟的懶惰, 我就只翻題目部分了。
有興趣的可以把前面的規則和技巧一起翻:P

網頁聯結:

比賽官網

題目說明檔 Instruction Booklet (Password: foo2rk)

比賽題目檔(鎖碼中~~)

密碼公開網頁(比賽開始時才開放)

以下中譯請對照題目說明檔看, 因為有部分題目有附圖形。

1.Battleships (Moshe Rubin) - 5 points
Locate the position of the 10-ship fleet in the grid. The fleet is shown below: one 4-unit battleship, two 3-unit cruisers, three 2-unit destroyers, and four 1-unit submarines. Each segment of a ship occupies a single cell. Ships are oriented either horizontally or vertically, and they do not touch each other, not even diagonally. The numbers on the right and bottom edges of the grid reveal the total number of ship segments that appear in each respective row or column. (For solving purposes, ignore the letters above and to the left of the grid.)

Answer: Enter the coordinates of the three missing 1-unit submarines (using the letters above and to the left of the grid).

1.發現小船(作者: Moshe Rubin) – 5分
請將圖表中的十艘船艦放入表格中。十艘船艦分別如下: 1艘4格的主力艦, 2艘3格的巡洋艦, 3艘2格的驅逐艦, 以及4艘1格的潛水艇。船隻的排放只能橫向或直向, 而且它們不能碰到彼此, 即使對角亦然。右方和下方的數字, 代表了在該橫列及該直行中, 共有幾格包含了船艦。(解題建議: 上方和左方的字母, 不要管它!!)

回答模式: 請輸入三艘題目中未列出的潛水艇對應位置(請用表格上方及左方的字母做表示)

2.Sudoku (Nikoli) – 10 points
Place the digits 1 through 9 into the empty squares (one per square) so that each digit appears exactly once in each of the following regions: the nine rows, the nine columns, and the nine outlined 3x3 regions.

Answer: Enter the seventh row of digits, followed by the seventh column of digits.

2.數獨(來源: Nikoli) – 10 分
將數字1-9放入空格中(每個格子一個數字), 讓每一直行, 每一橫列, 以及每一個粗框構成的3x3區域中, 數字1-9都各剛好只出現一次。

回答模式: 請寫下第七橫列的數字, 再接著寫下第七直行的數字。
3.Missing Operation KenKen(Nextoy LLC) – 10 points
Standard KenKen rules apply, but with the operations missing.
Fill each square with a digit between 1 and 6, not repeating a digit in any row or column. Each outlined region (cage) includes a target number, which is the result of some one arithmetic operation applied to all the digits inside the cage.
Cages with one square have no operation: the missing digit is the same as the target. Subtraction and division only appear in cages with two squares, and the digits may appear in any order. For cages with more that two squares, the digits are added or multiplied individually.

Answer: Enter the fifth row of digits, followed by the fifth column of digits.

3.沒給運算符號的KenKen(作者: Nextory LLC) – 10 分
基本上就是 KenKen 的規則, 但是沒給你運算符號的提示。
在每個方格中填入1-6其中一個數字, 每一直行及橫列數字都不能重覆。在圍成的區域中會給一個提示數字, 這代表了在區域中的所有數字, 在經過加減乘除其中一種運算後, 會得到的結果。
如果圍成的區域中只有一個方格, 那就代表該格的數字就是提示數字, 因為一個數字是沒法做運算的。減和除僅會出現在有兩格的區域中, 而且計算方式無關數字排列。超過兩格的區域, 數字則是使用加或乘其中之一做運算。

回答模式: 輸入第五橫列的數字, 再輸入第五直行的數字。

4.Sum Thing (Ed Pegg Jr.) - 10 points
Place each of the digits [list] into the empty circles (one per circle) so that the sum of the digits along each line is equal to [value].

Answer: Enter the digits in order from left to right, as they appear in the diagram.

4.某東西的總和(作者: Ed Pegg Jr.) – 10 分
將列表中的數字填入圓圈中(每個圓圈一個數字), 讓每條線上的數字總和, 會符合指定的值。
(譯注: 請參照 http://wpc.puzzles.com/gt7/solutions.htm , 第3題, 猜測可能是類似這樣)

回答模式: 由左至右, 依表格中數字出現順序輸入

5.Eminent D'OHmain (Adam R. Wood) - 10 points
Standard Eminent Domain rules, except there will be exactly one unconnected square in each row and column.
One or more horizontal or vertical lines are drawn from each numbered square. Lines cannot cross or overlap other lines or numbered squares. Each number indicates how many squares are connected by its lines (the numbered squares themselves are not counted). Each empty square is connected by exactly one line, except for
one square in each row and column, which will not be connected at all.

Answer: For each row, enter the column number (1-9) of the square that is not connected. (For the example, the answer would be 3,2,4,1.)

5.Eminent D'OHmain (作者: Adam R. Wood) - 10 分
基本的Eminent Domain規則(譯注: 請參照http://www.otuzoyun.com/pqrst/puzzle0204.html ), 但多加了一條規則 - 每直行及每橫列都會剛好有一格留空。
由每個數字出發, 畫一到多條直或橫的線, 線彼此不能交叉相碰, 也不能碰到其他數字。數字代表了由它出發的線, 共經過多少格子(但數字本身所在的格子不算在內)。除了每直行及每橫列要留空的格子外, 每個空格只能剛好有一條線經過。

回答模式: 輸入每一列中, 是在第幾個直行格子留空(像範例中的答案就是: 3,2,4,1)

6.Switch Cheese (Baxter/Merrill) - 1 point each; 5 point bonus for finding all ten
Find the ten differences between the two pictures. (The ten differences are clearly intentional and not subtle differences due to pixilation or graphic anomalies. Ignore any overall distortion of the images.)

Answer: Enter the coordinates for each difference found from top to bottom, left to right, starting with the first column.

6.調換乳酪(作者: Baxter/Merrill) – 每找到一個1分, 如果十個全數找到則有5分的額外獎勵。
請找到兩張圖中的十個不同點(所謂的不同, 是指圖中故意的出錯, 而不是那種因為畫素不清造成的些微差異)
(譯注: 過去這類題目通常兩張圖是鏡像)

回答模式: 從第一直行起, 由上而下, 再由左至右, 依序輸入錯誤位置的對應代表字母。

7.Writer’s Block(Craig Kasper) – 10 points
Enter names into the crisscross grid across and down, one letter per square. Four names will not be used.

Use only the portions of the name that are fully capitalized, ignoring spaces and punctuation; names are sorted and grouped by length.

Answer: Enter the four missing capitalized names (ignore spaces and punctuation if any).

7.Writer’s Block(作者: Craig Kasper) – 10 分
將名字輸入十字交叉表格中的行與列, 每個方格一個字母, 其中有四個名字將不會被用到。
僅使用名字當中大寫的部分, 忽略空格及標點。名字依其長度做排列。

回答模式: 輸入四個沒有用到的大寫名字(若有空格或標點, 請忽略)

8.Corral (Nikoli) - 15 points
Draw a single closed loop along the grid lines so that all the numbered squares are inside the loop. Additionally, each number equals the count of interior squares that are directly in line (horizontally and vertically) with that number's square, including the square itself.

Answer: Enter the number of squares in each connected group that is outside the loop, clockwise starting in the upper left. (The answer for the example would be: 3,3,2.)

8.Corral(來源: Nikoli) – 15 分
沿表格邊線, 畫一條單線構成的環, 讓所有的數字都包含在環的區域內。此外, 數字代表了該格沿直向或橫向走, 到碰到邊線為止, 在區域