Just for fun
Curiosities:
Riddles:
- There are 11 prisoners in separate cells, so that they
cannot communicate in any way. They can be made free if they
succeed in the following game. They are selected one by one
at random. Each time one is selected, he can go in a room
where there are 2 switches and (eventually) move them. They
win if at a certain point one of them declares that all of
them have been selected at least once. Before starting the
game they can meet together for some minutes to decide a
strategy. How can they win?
- What is the next number in this sequence?
| 1 |
| 11 |
| 21 |
| 1211 |
| 111221 |
| 312211 |
- How can you put eight queens on a chessboard so that none
of them is able to capture any other?
- N people arrive one after another in a
room. Each of them has either a blue or a red hat. Everyone
can see the hat of all the others, but not his own one. They
cannot communicate in any way. All of them will act in the
best way to obtain their task. What can they do to
subdivide themselves in two groups depending on the hat?
- Others coming soon.
Give a look to these sites:
Theory:
Do you need a new CS paper?
Is your program clear?
Is it cold in Madison?
What about Italians?
Pictures:
Web art:
Quizzes:
Poems:
Last update: August 19, 2009
Web Style Copyright © 2009 Giordano Fusco