Logic Masters Forum

About "Relay": http://puz.hp.infoseek.co.jp/honkaku/relay.html

I prepared the following image to explain the four direction of Japanese Kanji.


Please connect each direction character to the appropriate position of one of circles.
Circles may be rotated.

Is it possible that there is another rule? Like, every circle has to get exactly two connections?

Yes, and you have to use every square.

Rules of "Relay"

1. Every circle has to get exactly two connections and every square must be used.
2. You must connect every character(fore,back,right,left) to an appropriate side of a ball.


Please ask me anything about Naoki puzzles.
If I can't understand it, I'll tell Naoki to explain in detail.

About Hougan: http://puz.hp.infoseek.co.jp/honkaku/relay.html
(PDF) http://puz.hp.infoseek.co.jp/honkaku/hougan.pdf

I think "Hougan" is a puzzle which is very difficult to understand.
As it's a nice puzzle, I'll try to explain it now.

The following image is the example problem of Naoki's PDF.



Let's start to explain from the answer.

There are 7 blocks.



Now, let's check all relations between the block pairs touching each other.

1-2 AB - ACD
1-4 AB - AC
2-3 ACD - BCD
2-4 ACD ⊃ AC block 2 includes block 4
2-5　 ACD - BCD
3-5 BCD = BCD block 3 and block 5 are same
3-7 BCD - A
4-5 AC - BCD
4-6 AC - AB
5-6 BCD - AB
5-7 BCD - A

So,
the border between block 2 and block 4 is marked as ⊃,
the border between block 3 and block 5 is marked as =.
Others border lines are not marked.

Does this help you understand "Hougan"?
Please feel free to ask any question,

If you think that any problems of PDF has multiple answers, please let me know.

Does this mean that every possible relation is given?

(14.01.2010, 12:28)Semax schrieb: [ -> ]Does this mean that every possible relation is given?

Yes.

When no relation is show on the border of 2 blocks,
there are no relation between these 2 blocks.

Hi, I'm Naoki.

Unfortunately, I am one of the puzzle creators who can't speak English most in the world, sorry.

Most Japanese puzzle creators make a "new year puzzle".

Assign the numbers from 1 to 10 to these alphabets.
a+(b*c)+(d*e*f)+(g*h*i*j) = 2010

In Japan, most people exchange handreds of New Year's Cards (we call it "Nenga-jo") as you exchange Christmas cards.
Puzzlers create orizinal puzzle for it.
The following is the Sudoku Problem size 12 by 12 from our's New Year's Card (2010).

At the right side is the character of this year, Tiger.
This is a very easy problem. I hope you solve it without effort.
This problem is made by the program.
Naoki found the alglithm and Masaya Kimada(International collegiate programming contest, world final member of Japan) wrote a quite unique program.
This probram made many sudoku problems for Puzzle Magazines and Sudoku Books in Japan.

(19.11.2009, 20:38)~ÔttÔ~ schrieb: [ -> ]http://puz.hp.infoseek.co.jp/honkaku/nuruomino.html

Würde sagen, das ist LITS:

http://www.janko.at/Raetsel/LITS/index.htm

~ÔttÔ~

This puzzle was designed by Naoki.
And later, nikoli published "Pencil Puzzle Book -- LITS Vol.1"