Date: Fri, 04 Oct 1996 06:01:03 ARG From: "Ivan Skvarca" To: puzzle-l@listserv.acsu.buffalo.edu, nobnet@iijnet.or.jp Reply-to: nobnet@iijnet.or.jp Subject: [NOBNET 290] First Worldwide E-mail Puzzle Competition FIRST E-MAIL PUZZLE COMPETITION The Second Argentinian Puzzle Congress is beggining today October 4th and running through October 6th in Concordia, Entre Rios, Argentina. Those who are going to solve these problems will know that a group of enthusiastic puzzle solvers are gathered around games for three days at a mesopotamic city. RULES OF THE COMPETITION ---- Everyone can participate. Teams are allowed, though they count as a single person, having to send only one answer for each problem; that is, there is only one category. ---- This competition includes only three problems. The score for each of them is: * 50 points for the best solution. * 30 points for the second best. * 10 points for the third best. Bonus: 50 points to be shared by those who get the best solution. For instance: If there are eight (8) people with the equal best solution for a problem, then each of them get for that problem: 50 points (for getting the best solution) + 6 (bonus) = 56 points. ---- Answers must be sent only by e-mail. A separate e-mail must be sent for each of the three problems. Answer to problem 1 must be sent to prob1@milrud.ba.ar Answer to problem 2 must be sent to prob2@milrud.ba.ar Guess where must be sent the answer to problem 3... Yes, to prob3@milrud.ba.ar The subject of each e-mail must include only the number gotten as solution for that problem, and no other text; for example: 34. The solution for the problem must be included in the main body of the e-mail. ---- Answers must arrive before the last minute (Argentina time, -3:00 GMT) of October 7th 1996. No answers arriving later will be taken in count. It is not necesary to send answers for the three problems. ---- Final results will be known on October 14th 1996. as well as the answers for the problems. The winner will get his/hers/its deserved virtual prize. ---- We have sent this message to the following lists: Snark, Nobnet, Puzzle-l, Logica, Siproma-l. You are welcomed to reproduce it, both to other lists or friends. THE PROBLEMS ------------------------------------------------------------------ PROBLEM 1 (Your solution must be sent to prob1@milrud.ba.ar) Start with the squared figure (on the upper left side) and get to the Roman II (on the upper right side) in a minimum number of moves. A horizontal move consists of: 1. Determine a set of coins aligned horizontally. This set can have no holes (that is, it must be conected), and no neighbouring coins nor to the left nor to the right. 2. Move it to the right or the left as much as you can. In case of finding another coin or the end of the board, the move stops. Vertical moves must be understood in an analogous way. Moves are declared specifying two things: first, the square of the board in which the coin heading the line lies; second, the square of the board at which that heading coin ends. In the additional lower figure, these moves are valid: i3, i2 (line i3-i4-i5-i6 moves one square to the left) i3, i1 (line i3-i4-i5-i6 moves two squares to the left and finds the end of the board) i6, i7 (line i3-i4-i5-i6 moves one square to the right and finds the coin at i8) i6, i5 (column i6-j6-k6 moves one square up) k7, h7 (coin at k7 moves three squares up) 1 1 1 1 2 3 4 5 6 7 8 9 0 1 2 a . . . . . . . . . . . . b . O O O O . O O O O O . c . O O O O . . O . O . . d . O O O O . . O . O . . e . O O O O . . O . O . . f . . . . . . O O O O O . g . . . . . . . . . . . . h . . . . . . . . . . . . i . . O O O O . O . . . . j . . . . . O . . . . . . k . . . . . O O O . . . . l . . . . . . . . . . . . (Note: the initial position for the square is the indicated one; the Roman II may end anywhere on the board; the lower figure must be taken only for examples) ------------------------------------------------------------------ PROBLEM 2 (Your solution must be sent to prob2@milrud.ba.ar) Place as much tanks as you can in a square board, 8 squares each side, one tank maximum per square. Each tank must have with it a number indicating how far it attacks, horizontally and vertically (up, down, left and right). Two examples are shown: the tank marked 2 attacks the four squares marked A, the tank marked 3 attacks the two squares marked B The number of each tank must match the number of tanks attacking it. . . . . . . . . . . . . . . . . . 3 . A B . . . . . . . . . . . . A . 2 . A . . . B . . . . . . . . . A . . . . . . . . . . . . ------------------------------------------------------------------ PROBLEMA 3 (Your solution must be sent to prob3@milrud.ba.ar) Cut the 2 into the minimum number of pieces and rearrange them to make a perfect square. +---+---+---+---+ |XXX|XXX|XXX|XXX| +---+---+---+---+ |XXX| +---+---+---+ /X|XXX|XXX|X/ +---+---+---+ |XXX| +---+---+---+---+ |XXX|XXX|XXX|XXX| +---+---+---+---+ ------------------------------------------------------------------ Problem 1 created by Pablo Milrud. Problem 2 is based on an idea of Federico di Francesco. Problem 3 is a collective creation. This competition has been prepared by Gustavo Pi~eiro , Pablo Milrud and Ivan Skvarca . No questions may be answered since we will be at Concordia...! Good Luck, everyone.