US Puzzle Championship 2012 開催 - 拼圖

請原諒小弟的懶惰, 我就只翻部分題目了。
(另外因為我要準備去玩黑方的試玩版, 所以只翻到第10題, 剩下的題目就交給Pizza...喔, 不, 是Puzzlez大大了XDDD)

網頁聯結:

比賽官網 http://wpc.puzzles.com/uspc2012/

帳號登錄(要登錄才能比賽) http://wpc.puzzles.com/uspc2012/registration.asp

題目說明檔 Instruction Booklet (Password: dalm8n) http://130.94.227.149/puzzles/uspc/inst-12.pdf

比賽題目檔(鎖碼中~~) http://130.94.227.149/puzzles/uspc/uspc-12.pdf

密碼公開網頁(比賽開始時才開放) http://wpc.puzzles.com/uspc2012/password.asp

和以往不同的點是, 除非你要參加國家代表隊選拔進WPC(美國啦~~), 否則這次不用半夜爬起來比賽了, 未來一個星期你都可以參加, 只要點選開始就有2.5個小時的競賽時間。

正式開始時間: Saturday August 25, at 1pm EDT, and last 2 1/2 hours. (台灣中原標準時間 8/26 01:00 AM, 也是比2.5小時)

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

1. Battleships (Moshe Rubin) - 10 points
Locate the position of the 10-ship fleet (shown to the right) in the grid. Each segment of a ship occupies a single cell. Ships are oriented either horizontally or vertically, and 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.

Answer: Enter the coordinates of the four 1-unit ships (from left to right, top to bottom, starting with the first row).

1. Battleships( Moshe Rubin) 10分
將顯示在右方列表的10艘船放入格子中, 船的每一部分佔一個格子。船可以排成直向或橫向, 但是不能彼此相接鄰, 即使對角亦然。在表格中右方及下方的數字, 代表該橫列及該直行, 船佔住了幾格。

回答模式: 請輸入4艘單格的船隻位置(由右至左, 從上到下, 自第一橫列開始)

2. Complementary Domains (Michael Rios) – 5 points

Draw one or more horizontal or vertical lines emanating from each numbered square, crossing each blank square exactly once (lines connect only blank squares and cannot cross). Each number is the total of the following: the number of squares that are connected by its lines going up and to the right, minus the number of squares that are connected by its lines going down and to the left (the numbered squares themselves are not counted).
Ex.
Answer: Enter the digits (ignoring sign) connected to the squares in the two highlighted main diagonals, from upper-left to lower-right, and then from lower-left to upper-right. (For the Example, the answer would be 2233,1232.)

2. Complementary Domains(Michael Rios) 5分
自每個數字方塊直向或橫向畫出一到多條的線, 每個空格都會剛好經過一次(線不能重覆經過格子, 也不能交叉)。數字代表的是, 自這個數字方塊向上及向右的線經過的格數, 減掉自這個數字方塊向左及向下的線經過的格數(但數字格子本身不計)

回答模式: 輸入兩條主對角線格子中出現的數字(以較明顯顏色標註)。先從左上到右下, 左下到右上(以範例而言, 答案就是 2233,1232)

3. Shadow Boxing #1 (Cihan Altay) – 5 points

Some letters are printed on transparent material. Place the pieces into the grid so that each letter from A-I appears exactly once, right-side up. Pieces may be rotated and/or turned over, but must follow the grid lines and stay within the grid.
Ex. (I-IV):
[letter list]
[diagram]
Answer: Enter the letters for each row in order, starting with the first row left to right, followed by the second row, etc. (For the Example, the answer would be IV,II,I,III.)

3. Shadow Boxing #1 (Cihan Altay) – 5 分

字母印在透明材質的一些片子中, 將這些片子放入表格, 使得字母A-I各出現一次, 正面且朝上。片子可以旋轉或翻轉, 但是格線要對到表格的格線, 而且不能超出表格。

回答模式: 依序輸入每一橫列的字母, 先從第一橫列自左到右, 再第二橫列, 依次類推(範例答案: IV,II,I,III.)

4. Shadow Boxing #2 (Cihan Altay) – 10 points

Some numbers are printed on transparent material. Place the pieces into the grid so that each number from 1-9 appears exactly once, right-side up. Pieces may be rotated and/or turned over, but must follow the grid lines and stay within the grid.
[digit list]
[diagram]
Answer: Enter the numbers for each row in order, starting with the first row left to right, followed by the second row, etc. (For the Example above, the answer would be IV,II,I,III.)

4. Shadow Boxing #2 (Cihan Altay) – 10 分

數字印在透明材質的一些片子中, 將這些片子放入表格, 使得數字1-9各出現一次, 正面且朝上。片子可以旋轉或翻轉, 但是格線要對到表格的格線, 而且不能超出表格。

回答模式: 依序輸入每一橫列的字母, 先從第一橫列自左到右, 再第二橫列, 依次類推(範例答案: IV,II,I,III.)


5. Corral (Nikoli) - 10 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.
Ex.
Answer: Enter the number of squares in each connected group that is outside the loop, clockwise starting in the upper left. (For the Example, the answer would be: 3,3,2.)
Copyright ? 2012 U.S. Puzzle Championship. All rights reserved. Page 2 of 9

6. Math Flip #1 (Erich Friedman) – 5 分

7. Math Flip #2 (Erich Friedman) – 10 分

Place a digit into each of the empty spaces so that the equation is correct when viewed normally and when viewed up-side down. No digit appears more than once in an equation; zero is not used. Normal precedence rules apply (multiplication and division before addition and subtraction; otherwise left-to-right).
Ex.
Answer: Enter the missing digits from left to right. (For the Example, the answer would be 42375.)

在每個空格放入一個如右方所列的數字, 讓這個式子不管是正看或是旋轉180度倒看都是正確的。在一個式子中, 數字不會重覆, 且不使用0。一般數字運算規則通用(先乘除後加減, 由左至右做計算)

回答模式: 請由左到右輸入空格數字(範例答案: 42375)

8. A Crossword (Cihan Altay) - 20 points

Place all the given words into the grid crossword style (two or more consecutive letters across or down must form a word in the word list). All of the letter A's are given. Additionally, all the black squares have been replaced by A's.

Answer: Enter the letters in the 3rd row and the letters in the 10th row, indicating black squares by "-". (For the Example with the fourth and sixth rows, the answer would be AIL--C,E-DAM-).

8. A Crossword (Cihan Altay) - 20 分

將表列的英文字填入表格中, 依crossword 的規則(當2或多個字母連續出現在同排或同列時, 它們構成的單字就要出現於列表中)。表格已將所有會出現的A都列出, 但是答案中的空格位置(沒有放字母被塗黑的格子)也被替換成A了。

回答模式: 輸入第3橫列及第10橫列的字母, 以"-"代表沒有字母的黑格(範例答案: AIL--C,E-DAM-)

9. Pond Scum (Baxter/Merrill) – 1 point for each difference found; bonus: 5 points for finding all ten; penalty: -5 points if any difference is incorrect

Find the ten differences between the top picture and its reflection below.
The differences are clearly intentional, such as things that have disappeared, moved, changed size, shape, or orientation. Ignore the grid lines and subtle differences due to graphic anomalies or overall distortion. A grid square will contain at most one difference.
[diagram]
Answer: Enter the coordinates (in the form: X9) for up to 10 differences found.

9. Pond Scum (Baxter/Merrill) – 每找到一個1分, 如果十個全數找到則有5分的額外獎勵。但若其中有錯, 則會倒扣5分。

請找到上圖及下方它的鏡像圖中的十個不同點, 不同之處會很清楚, 像是有部件不見, 被搬移位置, 改變大小, 形狀或方向。(所謂的不同, 是指圖中故意的出錯, 而不是那種因為畫素不清造成的些微差異)。每個格子最多出現一個錯誤。

回答模式: 輸入10個錯誤對應的格子編號(如X9)。


10. Masyu (Nikoli) - 20 points
Find a single closed loop passing through each of the black and white circles. The loop passes through the centers of adjacent squares. When passing through a black circle, the loop must make a 90 degree turn and extend at least two squares in both directions. When passing through a white circle, the loop must go straight and must make a 90 degree turn in at least one of the adjacent squares.
Ex.
Answer: Enter the letters corresponding to the 15 labeled white circles in order along the loop, starting with A and traveling clockwise. (For the Example, the answer would be ADECB.)

10. Masyu (Nikoli) - 20 分

畫一個單一封閉的路徑, 走過所有的黑圓及白圓。路徑必須經過格子的中央, 再走到上下左右相鄰的格子。當經過黑圓時, 這個路徑必須直角轉彎, 而且至少兩格距離維持同一方向。當經過白圓時, 路徑必須直行, 但是在之前或之後的下一格(至少其中之一)必須立刻直角轉彎。

回答模式: 從A開始, 以順時鐘路徑方向, 依序寫出15個白圓代表的英文字母。(範例答案: ADECB)

11. Multiplicative Corral (Grant Fikes) - 15 points
Draw a single closed loop along the grid lines so that all the numbered squares are inside the loop. Additionally each given number is the product of two numbers: the number of interior squares that are directly in line vertically with that number's square (including the square itself), times the number of interior squares that are directly in line horizontally with that number's square (again, including that square itself).
Ex.
Answer: Enter the number of squares in each connected group that is outside the loop, clockwise starting in the upper left. (For the Example, the answer would be: 1,1,6,1)

沿格線畫一個單一封閉型的路徑, 使得所有數字都包含在路徑圈中。此外, 數字代表的意思, 是指該數字所在的格子, 於路徑圈內橫向連續的格子數(包含原本的格子)乘上直向連續的格子數(包含原本的格子)

回答模式: 自左上角開始, 順時針寫出路徑圈外每組相鄰格子的數目(範例答案: 1,1,6,1)


12. Packing for Croatia (Shawn Kennedy) – 20 points
Place the names of the 16 Croatian cities into the grid. Each name will be a snakelike strip of squares connected horizontally and vertically that does not turn back on itself (see examples of invalid snakes) and does not overlap other names. Exactly two letters are given for each name.

Answer: Enter the letters in the 3rd row followed by the letters in the 6th row.


13. Sudoku (Nikoli) – 20 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.
[diagram]
Answer: Enter the 3rd row of digits, followed by the 5th row of digits.

14. Tren (Serkan Y?rekli) – 20 points

Locate the position of blocks in the grid, one block corresponding to each of the given numbers. The blocks are either 1x2 or 1x3 units, and may only move in their long direction, stopped only by another block or the edge of the grid. Each number is equal to the total possible movement of its block.

Answer: Enter the contents of the 4th row followed by the contents of the 7th row, using the corresponding digit for each square covered by a block, and "-" for each empty space. (For the Example, the fourth and fifth rows would be: 0033-1,11-3-1.)

15. Pentahouses (Cihan Altay) – 20 points

Place the 12 given pentomino pieces into the grid so that all the skeleton clues are matched. Pieces may be rotated and/or reflected, but cannot touch each other, not even diagonally.

Answer: Enter the letters for the pentominoes as they appear left to right in the 2nd, 6th, and 12th rows. (For the Example, the second, fourth, and seventh rows would be: IO,L,TN.)

16. Space Probes (Cihan Altay) – 20 points

Locate two probes in each row and each column so that they don't touch each other, not even diagonally. Each clue outside the grid is the number of empty squares between the two probes in the corresponding row or column.

Answer: Enter the number of empty squares between each clue and the first probe in the corresponding row or column, starting with the clues across the top from left to right, then the clues along the left, from top to bottom. (For the Example, the answer would be 5,0,1.)

17. Tapa (Serkan Y?rekli) - 20 points

Paint some empty squares black to make a single network of paths, connecting squares vertically or horizontally, but never covering a 2x2 region. A square containing one or more numbers indicates the sizes of all groups of consecutively adjacent black squares, where multiple groups are separated by at least one white square.

Answer: Enter the lengths of the groups of black squares in the 3rd and 6th rows. (For the Example using the second and fourth rows, the answer would be 1,2,1,3.)

18. Magic Order (Cihan Altay) – 20 points

Enter the digits 1 through 6 once in each row and column so that 24 distinct 6-digit numbers are formed horizontally and vertically—reading forward and backward. Each clue pointing to a number indicates the position of that number when all 24 6-digit numbers are ordered from smallest to largest.

Answer: Enter the digits in the 3rd row followed by the digits in the 5th row. (For the Example, the answer would be 34215,51432.)

19. Frozen Pentominoes (Serkan Y?rekli) – 20 points

Place the given pentomino pieces into the grid so that they cannot slide in any direction. The given letters inside a square indicate all the pieces that touch that square, even at a point. Pieces may be rotated and/or reflected, and may touch each other, but cannot overlap. A piece cannot slide if it is blocked both horizontally and vertically by the clue cells, other pentominoes, or the edge of the grid.

Answer: Enter the contents of the 4th and 9th rows, using the corresponding letter for each square covered by pentomino pieces, and "-" for each empty or clue cell. (For the Example using the second row and fifth column, the answer would be: L-XXX-V,-XV--ZZ.)
Copyright ? 2012 U.S. Puzzle Championship. All rights reserved. Page 7 of 9

20. Snail's Nest (Serkan Y?rekli) – 20 points

Write each of the names in the word list into its own snail, entering the letters in order starting from the outside of the snail and spirally inward. Not all squares will be used, and "-" indicates those squares that must remain blank. A letter can not appear more than once in any row or column of the full grid. Ignore spaces and punctuation in the word list.

Answer: Enter the 3rd, 6th, and 10th rows, using "-" for empty squares. (For the Example, the answer would be -KCL-A,IAN-K-.)

21. Gapped Kakuro (Serkan Y?rekli) - 30 points

Enter a single digit from 1 to 9 into some empty squares so that the sum of the digits in each Across and Down answer equals the clue value given to the left or above, respectively. No digit is repeated within a single answer. Empty squares cannot be adjacent.

Answer: Enter the contents of the last row and the second column, using "-" for empty squares. (For the Example, the answer would be -1-6-982,-97861.)
Copyright ? 2012 U.S. Puzzle Championship. All rights reserved. Page 8 of 9

22. Fences Variation (Cihan Altay) - 30 points

Draw a single closed loop by connecting neighboring dots along the indicated paths. A numbered region indicates exactly how many of its edges are used by the path.

Answer: Enter the sum of the numbers in each connected group that is outside the loop, clockwise starting in the upper left . (For the Example, the answer would be 2,3,3,4).

23. Musketeer Sudoku (Adam R. Wood) - 30 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. Additionally, for each letter appearing in the grid, the corresponding squares contain either all the same digit or all different digits.

Answer: Enter the digits in the 6th row, followed by the digits in the 8th column. (For the Example, the answer would be 163452,321564.)

--