Errors in the example:
| Errata for Puzzle Design Tournament 2004 | |
| Go to home page | |
| Puzzle 01 by Alan O'Donnell | Send answers to aod@webtribe.net |
| As in standard 'balanced scales' problems, and as per the example, a node on a horizontal bar can have a maximum of one function. That means that strings cannot be suspended from pivots or weights, and there can only be one weight per node. | |
| Puzzle 02 by Alberto Fabris | Send answers to alberto.fa.03@libero.it |
| Puzzle 03 by Alexandre Owen Muniz | Send answers to munizao@xprt.net |
| |
|
| Puzzle 04 by Andreas Bolota | Send answers to andreas@campeuronet.com |
| Puzzle 05 by Aziz Ates | Send answers to azizates@yahoo.com |
| Last sentence: Maximize the minimum of these two numbers. Errors in the example: |
|
| Puzzle 06 by Cihan Altay | Send answers to cihan@otuzoyun.com |
| Puzzle 07 by Joseph DeVincentis | Send answers to devjoe@bellatlantic.net |
| Puzzle 08 by Ken Duisenberg | Send answers to kduis@yahoo.com |
| Puzzle 09 by Koksal Karakus | Send answers to karakusk@yahoo.com |
| Puzzle 10 by Luke Pebody | Send answers to ltp1000@cam.ac.uk |
| Puzzle 11 by Nuri Yilmaz | Send answers to nbouny@yahoo.com |
| Puzzle 12 by Ronald Stewart | Send answers to ronaldastewart@hotmail.com |
| Puzzle 13 by Scott Sheehan | Send answers to fractaled@hotmail.com |
| When counting intersections, an intersection is only present
when an intersection MUST be present. So disregard how some of the tiles
are drawn below (For example, the 5th row shows a few tiles
intersect, none of them count as intersections because it's possible to draw
them without intersecting). |
|
| Puzzle 14 by Tigin Kaptanoglu | Send answers to mu_zok@yahoo.com |
| Use commas between numbers and semi colons between layers to avoid ambiguity. Example's answer key would be: 24: 0,0,X,3 ; 4,0,2,0 | |
| Go to home page | |