请原谅小弟的懒惰, 我就只翻题目部分了。 有兴趣的可以把前面的规则和技巧一起翻:P 网页联结: 比赛官网 http://wpc.puzzles.com/history/tests/ca9/ 题目说明档 Instruction Booklet (Password: foo2rk) http://130.94.227.149/wpc/inst-09.pdf 比赛题目档(锁码中~~) http://130.94.227.149/wpc/uspc-09.pdf 密码公开网页(比赛开始时才开放) http://wpc.puzzles.com/history/tests/ca9/password.htm 以下中译请对照题目说明档看, 因为有部分题目有附图形。 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 分 沿表格边线, 画一条单线构成的环, 让所有的数字都包含在环的区域内。此外, 数字代表 了该格沿直向或横向走, 到碰到边线为止, 在区域内共有多少格(包含数字所在的这一格) 回答模式: 请由左上角开式, 顺时针依序输入区域外每一个小区域中, 有多少个格子(要 相连)。(像范例中的答案就是: 3,3,2) 9.Coordinate Pairs (Erich Friedman) - 10 points Connect pairs of points (using each point only once), so that the corresponding segments can be separated into two sets, each set containing segments with the same length. Answer: Enter the pair of letters corresponding to each segment, in "alphabetical" order. (For the example, the answer would be AC,BD,EF,GN,HL,IJ, KM.) 9.Coordinate Pairs (作者: Erich Friedman) - 10 分 将点两两相连成对(每个点只能连一次), 最後成对连线可以分成两群, 每群的成对连线长 度都相等。 回答模式: 输入每组成对连线的对应字母, 依字母顺序输入(像范例中的答案就是: AC,BD, EF,GN,HL,IJ,KM) 10.Triangular Skyscrapers (Aziz Ate.) - 15 points Place the digits 1 through 8 into the empty cells (one per cell) so that each digit appears exactly once in each row and column. One digit is given. The cells in the grid can be thought of as individual buildings, and the number inside the building is the number of floors. A number outside the grid indicates how many buildings can be "seen" from the corresponding direction. (A building is seen by an observer if there are no buildings taller (with a greater number), between it and the observer.) Answer: Enter the digits in the second row, followed bythe digits in the second column. (For the example, the answer would be 56147832,32147658.) 10.三角形摩天大楼 (作者: Aziz Ate.) - 15 分 将数字1-8放入空格中, 每个数字在每行及每列只能出现一次, 其中一个数字已给提示。 可以把格子想像成是一栋独立建筑, 而数字就是这栋建筑有几层楼。格子外的数字则是代 表从该方向看过去, 可以看到几栋楼(建筑只有在它和观察者之间, 没有其他比它更高的 楼时(也就是数字更大的), 才能被看到 回答模式: 输入第二横列的数字, 再紧跟着输入第二直行的数字, 像范例中的答案就是: 56147832,32147658 11.WindowPain (Anonymous) – 10 points Count the number of squares of any size in the diagram. (All lines connect points on the implied lattice grid.) Answer: Enter the number of squares in the diagram. 11.WindowPain (Anonymous) – 10 分 图中有几个正方形, 去数吧!! 回答模式: 请输入图中正方形的数目 12.Masyu (Nikoli) - 20 points Find a single closed loop passing through each of the black and white circles. The path passes through the centers of adjacent squares. When passing through a black circle, the path must make a 90 degree turn and extend at least two squares in both directions. When passing through a white circle, the path must go straight and must make a 90 degree turn in at least one of the adjacent squares. Answer: Enter the letters corresponding to the labeled white circles through which the path passes vertically, traveling clockwise starting with circle A. (For the example, the answer would be ACB.) 12.黑珍珠白珍珠(来源: Nikoli) - 20 分 请找出一条单线构成的环状路径, 要能通过所有黑色及白色的圆圈。路径为连接两相邻格 的中心点。路径在通过黑色圆圈时要转90度角, 并且至少在转角的两方向至少延伸两格长 (译注: 就是包含转角, 要到第三格才能转弯)。路径通过白色圆圈时要保持直线, 而且两 端在连到相邻格後, 至少有其一要立即转弯。 回答模式: 顺时针方向, 从A开始, 依序输入路径为直向通过的白色圆圈代表字母(像范例 中的答案就是 ACB) 13.C Notes (Erich Friedman) - 10 points For each of the given digits, add a digit before, after, or not at all, so that the resulting 1- and 2-digit numbers in each row and column all total 100. Answer: Enter the resulting nine numbers, left to right, top to bottom, starting with the first row. (For the example, the answer would be 9,63,28,12,20,68,79,17,4.) 13.C Notes (作者: Erich Friedman) - 10 分 在每个所给的数字, 它的前面, 或是後面加一个数字, 不过你也可以都不加。目的是要让 它构成一个一位或两位的数字, 而且每行及每列最後的数字总和都是100。 回答模式: 从第一横列开始, 输入最後的九个数字, 由左至右, 再由上至下。(像例中的答 案就是: 9,63,28,12,20,68,79,17,4) 14.Lucky Sevens (ShawnKennedy) - 20 points Enter words into the crisscross grid across and down, one letter per square. One word will not be used. Answer: Enter the unused word. 14.幸运的7字母文字 (作者: ShawnKennedy) - 20 分 将文字输入十字交叉表格中的行与列, 每个方格一个字母, 其中有一个字将不会被用到。 回答模式: 输入那个没用到的字。 15.2-3 Maze (Erich Friedman) - 15 points Find a path from the lower left to the upper right. You may move only between white squares, moving from one square to the next by jumping two squares diagonally, three squares horizontally, or three squares vertically. Answer: Enter the length of each move, in order, from start to finish. (For the example, the answer would be33233.) 15.2-3 迷宫 (作者: Erich Friedman) - 15 分 请找出由左下角移动到右下角的路从, 你的移动方式是自所在的格子, 向对角方向跳两格 , 或是朝直或横的方向跳三格, 移动过程中, 每次落脚的地方都必须是白色格子。 回答模式: 从开始到最後, 依顺序输入每次移动的长度(像范例中的答案就是: 33233) 16.Sweet Sixteen (Ken Duisenberg) – 15 points Place the numbers [list] into the circles (some numbers are already placed for you), so that the sum along each line is the same. Answer: Enter the numbers in the shaded circles, from left to right. 16.甜蜜的16(岁??)(作者: Ken Duisenberg) – 15 分 将列表中的数字填入圆圈中(部分数字已提供给你), 让每条线上的数字总和都一样。 回答模式: 由左至右, 输入有灰影格子当中的数字。 17.Yajilin (Nikoli) - 25 points Add black squares to the grid (only in the empty spaces) so that every arrow points to the corresponding number of black squares. Black squares need not be pointed to, and cannot be adjacent horizontally or vertically. All remaining white space must be part of a single closed loop of squares connected horizontally or vertically. Answer: For each of the nine rows indicated by arrows, enter the number of black squares. (For the example, the answer would be 2,0,1,0.) 17.Yajilin (来源: Nikoli) - 25 分 在部分空格中涂黑, 使得每个箭头附上的数字, 就是所指的方向涂黑格子的数目。黑色 格子”不一定”要被箭头指到, 而且和其他黑色格子不得以直或横向相邻。剩下的白色 格子要能以直向或横向连接後, 形成一个单线环状回圈。 回答模式: 依序输入在九条横列中, 有箭头的列当中有几个黑色格子(像范例中的答案 就是: 2,0,1,0) 18.Wolves and Sheep in Fences (Dave Tuller) - 25 points Draw a single closed loop by connecting neighboring dots horizontally or vertically (but not diagonally). A numbered square indicates exactly how many of its edge segments are used by the path. A square containing a sheep ("s") must end up inside the loop; a square containing a wolf ("w") must end up outside the loop. Answer: Enter the digits inside the loop, from left to right, top to bottom, starting with the first row. (For the example, the answer would be 3,23.) 18.数连中的狼与羊 (作者: Dave Tuller) - 25 分 将部分直向或横向相邻的点连接, 构成一个单线环状回圈, 数字代表了在它周遭有几个 边路径会通过。 包含 s 的格子表示羊, 必须留在环状区域当中, 而包含 w 的格子则代表狼, 必须留在 环状区域外面。 回答模式: 从第一横列开始, 由左至右, 再由上至下, 输入环状回圈内的数字(像范例中 的答案就是: 3,23) 19.Magic Puzzle'Rs (Craig Kasper) - 20 points Place the names into the grid, across, down, or diagonally down-and-to-the-right , with one letter per white square. Each row and column will contain exactly one "R". Answer: For each row, enter the column number (1-9) of the square containing the "R"; starting with the first row. (For example, if the "R"s appeared on the second main diagonal, the answer would be 987654321.) 19.神奇的 Puzzle'Rs (作者: Craig Kasper) - 20 分 将名字填入格子中, 每格一个字母, 可能是直向, 横向, 或是斜向(以向下向右方式填入) , 最後每行及每列都必须刚好有一个 R。 回答模式: 从第一横列开始, 由上而下, 输入每一横列中, R出现 在第几条直行。(像如 果R正好出现在从右上到左下的对角线上, 那答案就会是: 987654321) 20.SuDUOku (Adam R. Wood) - 30 points Place the digits 1 through 7 into the empty squares (one per square) so that each digit appears at least once in each of the following regions: the eight rows, the eight columns, and the eight outlined regions. Each of the digits 1 through 6 will appear twice in exactly one row, one column , and one of the eight outlined regions. Answer: Enter the duplicate digits for each row (from top to bottom), followed by the duplicate digits for each column (from left to right). 20.数O独 (作者: Adam R. Wood) - 30 分 将数字1-7放入空格中(一个格子放一个), 使得在八条横列, 八个直行, 以及八个粗线框区 域中, 每个数字都至少出现一次。 但是数字1-6 将会各自在某一行, 某一列, 以及某一个粗线框区域中, 正好出现两次。 回答模式:从上而下输入每一列重覆的数字, 再接着由左而右输入每一直行重覆的数字。 然後….因为我要准备出门了, 所以剩下的就大家自己看吧…. 有人要接手翻译吗??:P 21. Di-Agony(Craig Kasper) – 30 points Find a continuous loop made of 18 alternating horizontal and vertical segments, and number the 90° turns sequentially 1-9,1-9, in that order. Each row and column of the grid must contain exactly two turns. Some squares include a "diagonal sum", equal to the sum of all the turn numbers in the two diagonals passing through the corresponding square. In the example, 13 = 3 + 4 + 4 + 2, and 5 = 3 + 2. Answer: Enter the 18 digits from left to right, top to bottom, starting with the first row. (For the example, the answer would be 23,14,14,23.) 22.Four Square (Aziz Ate.) - 30 points The four puzzle types: Skyscraper, Battleships, Tents, and Snake, all rely on clue numbers around the outside of the grid. Find the missing clues that are shared between the grids below so that all four puzzlescan be solved. Skyscrapers: Place the digits 1 through 6 into the grid so that each number appears exactly once in each row and column, and so that the clue numbers are the number of buildings that can be "seen" from the corresponding direction. (Detailed Skyscrapers instructions are given in problem 11.) Battleships: Place the given fleet into the grid so that ships do not touch each other, not even diagonally. The clue numbers are the number of ship segments in the corresponding row or column. (Detailed Battleships instructions are given in problem 1.) Tents: Locate the tents in the grid. Trees and tents appear in distinct pairs, in horizontally or vertically adjacent squares. Squares with tents do not touch each other, not even diagonally. The clue numbers are the total number of tents in the corresponding row or column. Snake: Find a path of sequentially numbered and edge-connected squares starting from 1, passing through 17, and ending at 29. The path cannot loop back to touchitself, not even diagonally. The clue numbers are the number of times the snake makes a 90° turn in the corresponding row or column. [diagram] Answer: Enter the row of 13 missing clue numbers, followed by the column of 14 missing clue numbers. (For the example, the answer would be 212,1202,212,20201.) 23.Inside/Outside Corral (Dave Tuller) – 40 points Draw a single closed loop along the grid lines. If a number is inside the loop then it equals the count of interiorsquares that are directly in line (horizontally and vertically) with that number's square, including the square itself. Similarly, if a number is outside the loop then it equals the count of exterior squares that are directly in line 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. (For the example, the answer would be: 3,3,2.) --

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