TRIVIA GAMES

visuarchie

The Tower of Hanoi (also called the Tower of Brahma or Lucas' Tower and sometimes pluralized) is a mathematical gameor puzzle. It consists of three rods and a number of disks of different sizes, which can slide onto any rod. The puzzle starts with the disks in a neat stack in ascending order of size on one rod, the smallest at the top, thus making a conical shape.

The objective of the puzzle is to move the entire stack to another rod, obeying the following simple rules:

• Only one disk can be moved at a time.
• Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack.
• No disk may be placed on top of a smaller disk.
  

With 3 disks, the puzzle can be solved in 7 moves. The minimal number of moves required to solve a Tower of Hanoi puzzle is 2n − 1, where n is the number of disks.

Origin

The puzzle was invented by the French mathematician Édouard Lucas in 1883. There is a story about an Indian temple in Kashi Vishwanath which contains a large room with three time-worn posts in it, surrounded by 64 golden disks. Brahmin priests, acting out the command of an ancient prophecy, have been moving these disks in accordance with the immutable rules of Brahma since that time. The puzzle is therefore also known as the Tower of Brahma puzzle. According to the legend, when the last move of the puzzle is completed, the world will end. It is not clear whether Lucas invented this legend or was inspired by it.

If the legend were true, and if the priests were able to move disks at a rate of one per second, using the smallest number of moves it would take them 264 − 1 seconds or roughly 585 billion years to finish, which is about 42 times the current age of the Universe.

There are many variations on this legend. For instance, in some tellings the temple is a monastery, and the priests are monks. The temple or monastery may be said to be in different parts of the world — including Hanoi, Vietnam, — and may be associated with any religion. In some versions other elements are introduced, such as the fact that the tower was created at the beginning of the world, or that the priests or monks may make only one move per day.

Solution

The puzzle can be played with any number of disks, although many toy versions have around 7 to 9 of them. The minimal number of moves required to solve a Tower of Hanoi puzzle is 2n − 1, where n is the number of disks. This is precisely the nth Mersenne number.

Iterative solutionA simple solution for the toy puzzle is to alternate moves between the smallest piece and a non-smallest piece. When moving the smallest piece, always move it to the next position in the same direction (to the right if the starting number of pieces is even, to the left if the starting number of pieces is odd). If there is no tower position in the chosen direction, move the piece to the opposite end, but then continue to move in the correct direction. For example, if you started with three pieces, you would move the smallest piece to the opposite end, then continue in the left direction after that. When the turn is to move the non-smallest piece, there is only one legal move. Doing this will complete the puzzle in the fewest number of moves.

vinodnamdeo

Participant to TRIVIA GAMES-Friday 20 Oct 2017"

mircteryx

It's time to announce the winner.

Wednesday 25 Oct 2017
Answers:
1. Golfer
2. Sparrow
3. Lose their leaves in winter
4.Spoon
5. Dentist
6. Lady Chatterlys lover
7. Plum
8. Six
9. The Producers
10. Douglas Bader

The winner is banker21  

Other participants:
-vinodnamdeo
-visuarchie

banker21 please write something about " DOUGLAS BADER " to get reward.You can post direct on the thread (this time only).

vinodnamdeo please write the following:" Participant to TRIVIA GAMES-Wednesday 26 Oct 2017" to get reward as participant.You can post direct on the thread (this time only).
visuarchie please write the following:" Participant to TRIVIA GAMES-Friday 20 Oct 2017" to get reward as participant.You can post direct on the thread (this time only).

banker21

mircteryx 26-10-2017 06:53 PM
It's time to announce the winner.

Wednesday 25 Oct 2017

Group Captain Sir Douglas Robert Steuart Bader, CBE, DSO & Bar, DFC & Bar, FRAeS, DL;(21 February 1910 – 5 September 1982) was a Royal Air Force flyingace during the Second World War. He was credited with 22 aerialvictories, four shared victories, six probables, one shared probable and 11enemy aircraft damaged.

Baderjoined the RAF in 1928, and was commissioned in 1930. In December 1931, whileattempting some aerobatics, he crashed and lost both his legs. Having beenon the brink of death, he recovered, retook flight training, passed his checkflights and then requested reactivation as a pilot. Although there were noregulations applicable to his situation, he was retired against his will onmedical grounds.[3] After the outbreak of theSecond World War in 1939, however, Douglas Bader returned to the RAF and wasaccepted as a pilot. He scored his first victories over Dunkirk duringthe Battle of France in 1940. He then took part in the Battle ofBritain and became a friend and supporter of Air Vice Marshal TraffordLeigh-Mallory and his "Big Wing" experiments.

Bader left the RAF permanently in February 1946and resumed his career in the oil industry. During the 1950s, a book and afilm, Reach for the Sky, chronicled his life and RAF career to the end ofthe Second World War. Bader campaigned for the disabled and in the Queen'sBirthday Honours 1976 was appointed a KnightBachelor "for services to disabled people" and continued to fly until ill health forced him tostop in 1979. Three years later, at the age of 72, Bader died on 5 September1982, after a heart attack.

mircteryx

Thursday 26 Oct 2017

1. Which of the four tiles completes the picture?

2. Find the fifteen words hidden in the grid.They can be read horizontally, vertically, or diagonally; backward or forward; up or down.The same letter can be used in several different words.
HINT: the theme is clothes

3. Take a careful look at these two sets of characters.Which characters appear in the series on the right but not in the series on the left?


Good luck !

mircteryx

Hello everybody,

Another milestone breakdown: 1000 views.


Thanks to all !!

visuarchie

Participant to TRIVIA GAMES-Friday 20 Oct 2017

vinodnamdeo

Participant to TRIVIA GAMES-Wednesday 26 Oct 2017"

vinodnamdeo

mircteryx 26-10-2017 08:26 PM
Hello everybody,

Another milestone breakdown: 1000 views.

wow, best wishes for coming days also

mircteryx

It's time to announce the winner.

Thursday 26 Oct 2017
Answers:
1. The missing tile is 4.
2.

3. The characters that can be found only on the right are 1, 4, and 6

The winner is visuarchie  

Other participant:
-vinodnamdeo


visuarchie please write something about " DENIM " to get reward.You can post direct on the thread (this time only).

vinodnamdeo please write the following:" Participant to TRIVIA GAMES-Thursday 26Oct 2017" to get reward as participant.You can post direct on the thread (this time only).