5% Bonus Points Back!

Shop Japan. We ship worldwide, bringing Japan directly to you.

Graze a toy puzzle type of the tree to use a hand and the head which are most suitable for good toy receiving a prize toy cognitive education in Japan for and is made in prevention of baby toy 木育知育玩具 senility Japan♪

●数学パズル ハノイの塔 (虹のバージョン)木のおもちゃ 型はめ パズル 日本製 知育玩具 積み木 1歳 プレゼント ランキング 2歳 3歳 4歳 5歳 6歳 7歳 誕生日ギフト 出産祝い 男の子 女の子 赤ちゃん おもちゃ 国産 エイジレス 木育 高齢者 ボケ防止

●数学パズル ハノイの塔 (虹のバージョン)木のおもちゃ 型はめ パズル 日本製 知育玩具 積み木 1歳 プレゼント ランキング 2歳 3歳 4歳 5歳 6歳 7歳 誕生日ギフト 出産祝い 男の子 女の子 赤ちゃん おもちゃ 国産 エイジレス 木育 高齢者 ボケ防止
  • ●数学パズル ハノイの塔 (虹のバージョン)木のおもちゃ 型はめ パズル 日本製 知育玩具 積み木 1歳 プレゼント ランキング 2歳 3歳 4歳 5歳 6歳 7歳 誕生日ギフト 出産祝い 男の子 女の子 赤ちゃん おもちゃ 国産 エイジレス 木育 高齢者 ボケ防止
  • ●数学パズル ハノイの塔 (虹のバージョン)木のおもちゃ 型はめ パズル 日本製 知育玩具 積み木 1歳 プレゼント ランキング 2歳 3歳 4歳 5歳 6歳 7歳 誕生日ギフト 出産祝い 男の子 女の子 赤ちゃん おもちゃ 国産 エイジレス 木育 高齢者 ボケ防止
  • ●数学パズル ハノイの塔 (虹のバージョン)木のおもちゃ 型はめ パズル 日本製 知育玩具 積み木 1歳 プレゼント ランキング 2歳 3歳 4歳 5歳 6歳 7歳 誕生日ギフト 出産祝い 男の子 女の子 赤ちゃん おもちゃ 国産 エイジレス 木育 高齢者 ボケ防止
Buy it and earn 41 points! About Points
$ 37.54 (¥ 4,104)
Actual price may vary according to exchange rates.
Payment will be charged in yen
19 items left
Please select options before adding to cart.
Payment Methods: Details
Credit Card

Product Information


Mathematics puzzle Tower of Hanoi


Japanese good toy receiving a prize toy (2014)

木のおもちゃ ギフト 出産祝い




Eijiless toy, Tower of Hanoi
The Tower of Hanoi which appears in a textbook of the mathematics. In fact, it is a wide toy of the width to be able to be idle from a small child to the elderly. Of course it is recommended for the childish garden where a puzzle and a riddle become fun, the infants whom a hand became able to move freely to become the teaching materials of a student. (drinking by mistake attention of red parts)
An adult as a mathematics puzzle. Do a primary schoolchild and a childish garden compete with father, mother?
A smaller child is also begged for freely and moves a disk. Are the sound called the clangor of the disk, colorful rainbow color good?
As it is the toy which does not choose the generation, you can enjoy it for a long time.
Because I use safe vegetable paint, a small child licks it and is peach security.


On the child stick of the woman at 1 year, 8 months old of putting it is fun?

[problem]Move all seven colors of disks from a red pillar to other pillars.
★Rule of the game
1. I change by one piece in once.
2. I cannot ride a big disk on the small disk.
3. I cannot put a disk in the place except the pillar.

■Advice
When you do not understand it, read a right hint. The first eight times are displayed. When it is difficult, I begin with little number of sheets and will increase the number of the steps little by little. Whenever by one step increases, the number of the steps becomes the difficulty of the double. I will let the movement of all the paragraphs succeed with effort. ★It is a challenge in the most shorthand notes if I all clear it! ※The most shorthand notes of the Milky Way studio official recognition are 71 seconds. It is a certain NGO Press and Information Office 21-year-old woman. I used the both hands.



With the Tower of Hanoi (the source: a-free encyclopedia "Wikipedia (Wikipedia)")
French mathematician E リュカ (Edouard Lucas) thought about the Tower of Hanoi in 1883. リュカ explains that the following legend is in India.

Tower of the bluff mer
There is a temple of Confucius to express the world center in Benares (Varanasi) of the ridge of the Ganges River of India. The pillar (there is the opinion with the needle of the diamond) of three marbles is put up there, and it is said that it was repeated sequentially by the disk that 64 pieces of golden disks are big to one at first of those. Brahman monks perform work to move a disk to a different pillar all day there. And it is said that I collapse, and the world reaches the end when the transference substitute of all disks was over.
Of course this is a made-up story of リュカ, but suffers for approximately 584,500 million years saying that 18,446,744,073,709,551,615 times suffer even at least to move 64 pieces of disks and suffered for one second though they move one piece (in addition, the Big Bang is considered to be the outbreak approximately 13,700 million years ago now).

Method of the calculation of the number of the steps and the trouble
It is four steps of 15 times with three steps with two steps with one step seven times three times once. In other words, it is 2 n 乗 -1 when I assume the number of the steps n. For example, when move ten steps of disks; 2 10 乗 = 1024. It will take 1,023 times of trouble when I subtract 1 from there. When I calculate the time required when I moved once a second‥‥
One step
Two steps
Three steps
Four steps
Five steps
Six steps
Seven steps
Eight steps
Nine steps
Ten steps
11 steps
12 steps
13 steps
14 steps
15 steps
16 steps
17 steps
18 steps
19 steps
20 steps
21 steps
22 steps
23 steps
24 steps
25 steps
26 steps
27 steps
28 steps
29 steps
30 steps
31 steps
32 steps
Once
Three times
Seven times
15 times
31 times
63 times
127 times
255 times
511 times
1,023 times
2,047 times
4,095 times
8,191 times
16,383 times
32,767 times
65,535 times
13, 1,071 times
262,143 times
524,287 times
1,048,575 times
2,097,151 times
4,194,303 times
8,388,607 times
16,777,215 times
33,554,431 times
67,108,863 times
134,217,727 times
268,435,455 times
536,870,911 times
1,073,741,823 times
2,147,483,647 times
4,294,967,295 times
One second
Three seconds
Seven seconds
15 seconds
31 seconds
One minute three seconds
Two minutes seven seconds
Three minutes 15 seconds
Six minutes 31 seconds
17 minutes three seconds
34 minutes seven seconds
One hour eight minutes 15 seconds
Two hours 16 minutes 31 seconds
Four hours 33 minutes three seconds
Nine hours six minutes seven seconds
18 hours 12 minutes 15 seconds
12 hours 24 minutes 31 seconds a day
3rd 49 minutes three seconds
6th one hour 38 minutes seven seconds
12th three hours 16 minutes 15 seconds
24th six hours 32 minutes 31 seconds
48 days 13 hours four minutes three seconds
97 days two hours ten minutes seven seconds
194 days four hours 20 minutes 15 seconds
One year 23rd eight hours 40 minutes 31 seconds
Approximately two years 46 days 17 hours
Approximately four years three months
Approximately 8.5 years
Approximately 17 years
Approximately 34 years
Approximately 68 years
Approximately 136 years


木のおもちゃ ハノイの塔

I am challenging older sister Tower of Hanoi of an elder. Which is early with father?

The Tower of Hanoi which I was given for a Japanese souvenir


A 11-year-old girl thinks seriously.


It is a pose completion yes at last ♡

木のおもちゃ 名入れ 出産祝い wooden toys

木のおもちゃ 名入れ 出産祝い
The name is a laser, and there is service carved a seal in this way.
The name is that I enter, and the service is chargedThisPlease apply for からお.

Voice of the joy of the visitor
Receive a toy puzzle type of the tree; a baby toy
Product made in Eijiless toy Japan which does not choose the generation
Mathematics puzzle Tower of Hanoi
Eijiless toy, Tower of Hanoi
The Tower of Hanoi which appears in a textbook of the mathematics. In fact, it is a wide toy of the width to be able to be idle from a small child to the elderly. Of course it is recommended for the childish garden where a puzzle and a riddle become fun, the infants whom a hand became able to move freely to become the teaching materials of a student. An adult as a mathematics puzzle. Do a primary schoolchild and a childish garden compete with father, mother?
A smaller child is also begged for freely and moves a disk. Are the sound called the clangor of the disk, colorful rainbow color good? As it is the toy which does not choose the generation, you can enjoy it for a long time. Because I use safe vegetable paint, I am safe for a small child.
[problem]
Move all seven colors of disks from a red pillar to other pillars.

★Rule of the game
1. I change by one piece in once.
2. I cannot ride a big disk on the small disk.
3. I cannot put a disk in the place except the pillar.
French mathematician E リュカ (Edouard Lucas) thought about the Tower of Hanoi in 1883. リュカ explains that the following legend is in India.

Tower of the bluff mer
There is a temple of Confucius to express the world center in Benares (Varanasi) of the ridge of the Ganges River of India. The pillar (there is the opinion with the needle of the diamond) of three marbles is put up there, and it is said that it was repeated sequentially by the disk that 64 pieces of golden disks are big to one at first of those. Brahman monks perform work to move a disk to a different pillar all day there. And it is said that I collapse, and the world reaches the end when the transference substitute of all disks was over.
Of course this is a made-up story of リュカ, but suffers for approximately 584,500 million years saying that 18,446,744,073,709,551,615 times suffer even at least to move 64 pieces of disks and suffered for one second though they move one piece (in addition, the Big Bang is considered to be the outbreak approximately 13,700 million years ago now).
Method of the calculation of the number of the steps and the trouble
It is four steps of 15 times with three steps with two steps with one step seven times three times once. In other words, it is 2 n 乗 -1 when I assume the number of the steps n. For example, when move ten steps of disks; 2 10 乗 = 1024. It will take 1,023 times of trouble when I subtract 1 from there.
The name is a laser, and there is service carved a seal. The name is that I enter, and the service is chargedThisPlease apply for からお.
It is a luxurious present from nature which does not choose the generation.
Tree (pay) which wants to carve a seal by the name to a toy
To the page of the lapping
To the TOP of the shop

Recently Viewed Products

See All >

Payment Methods

Available Payment Methods

  • Credit Card

Remarks

Credit Card, Alipay

Credit Card We accept credit and debit cards.
The following credit and debit cards can be used:
•Visa
•MasterCard
•American Express
•JCB
•others
Alipay The “Payment Amount” is calculated as below. “Payment Amount” = Product price total + shipping fee Upon confirming your order, we will send you a link to make a payment via Alipay’s secure payment page. You must finish the payment process before the deadline to complete your order. Please check the payment process from the link here. PC: https://global.rakuten.com/en/help/payment/alipay_pc.html Smartphone/Tablet : https://global.rakuten.com/en/help/payment/alipay_mobile.html
×

Not available for Overseas shipping

This product cannot be shipped to Us United States from the store.

Please contact the store for further information.

×

Delivery Rates : EMS (International Express Mail Service)

Ship to
Shipping Option
Note: Exchange rates are for reference only.
Back to Top