请原谅小弟的懒惰, 我就只翻部分题目了。 (另外因为我要准备去玩黑方的试玩版, 所以只翻到第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.) --

※ 发信站: 批踢踢实业坊(ptt.cc) ◆ From: 163.20.175.44