In The 1st month of this year(the year 2013), I noticed that the date 13-1-13 (13 January 2013) is special.

This date is special as:

Date * Month = Year.

Can you figure out which year of this century has a maximum number of such dates?

The warden meets with 23 new prisoners when they arrive. He tells them, "You may meet today and plan a strategy. But after today, you will be in isolated cells and will have no communication with one another.

"In the prison is a switch room, which contains two light switches labeled 1 and 2, each of which can be in either up or the down position. I am not telling you their present positions. The switches are not connected to anything.

"After today, from time to time whenever I feel so inclined, I will select one prisoner at random and escort him to the switch room. This prisoner will select one of the two switches and reverse its position. He must flip one switch when he visits the switch room, and may only flip one of the switches. Then he'll be led back to his cell.

"No one else will be allowed to alter the switches until I lead the next prisoner into the switch room. I'm going to choose prisoners at random. I may choose the same guy three times in a row, or I may jump around and come back. I will not touch the switches, if I wanted you dead you would already be dead.

"Given enough time, everyone will eventually visit the switch room the same number of times as everyone else. At any time, anyone may declare to me, 'We have all visited the switch room.'

"If it is true, then you will all be set free. If it is false, and somebody has not yet visited the switch room, you will all die horribly. You will be carefully monitored, and any attempt to break any of these rules will result in instant death to all of you"

What is the strategy they come up with so that they can be free?

What does this rebus means ?

PROG WORKRESS

Replace all '*' with digits 1, 2, 3, 4, 5 and 6 to make below statement true.

* *
x *
=====
* * *

Who always enjoys poor health?

In the picture, you can see a chess board. On the top left position, the K marks a knight. Now, can you move the knight in a manner that after 63 moves, the knight has been placed at all the squares exactly once excluding the starting square?

Quickly Solve this riddle

7 - 4 + 3 * 0 + 1 = ?

I possess a head

I flaunt a tail

But I don't have mouth or legs

Can you find out who I am?

I ask Joseph to pick any 5 cards out of a deck with no Jokers.

He can inspect then shuffle the deck before picking any five cards. He picks out 5 cards then hands them to me (Jack can't see any of this). I look at the cards and I pick 1 card out and give it back to Joseph. I then arrange the other four cards in a special way, and give those 4 cards all face down, and in a neat pile, to Jack.

Jack looks at the 4 cards i gave him, and says out loud which card Joseph is holding (suit and number). How?

The solution uses pure logic, not sleight of hand. All Jack needs to know is the order of the cards and what is on their face, nothing more.

Buy me, smell me or deliver me, I do not change.

Who am I?