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?
As you can see in the picture, the strategy used here is to cover the border first and then move to the inner squares.
Role Action
Block Prevents the target player from acting
Redirect Change target player target.
Save Protects the target player from death.
Seer Sees all actions that occurred
Murderer Kills the target player
Following five players are playing:
Andy
Brian
Chris
Daniel
Fred
You are Andy the Seer and you saw the following things:
a) Brian was redirected to Chris.
b) Chris was blocked.
c) Daniel was killed.
Who is the murderer then?
The murderer is Fred.
Andy is the seer so exclude him.
Now, if Brian was murderer, then Chris should have been killed.
Now we know that Chris was blocked. Therefore he cannot be the murderer.
Daniel cant be the killer as he was killed himself.
This leaves with Fred.
In a chess board, the queen piece can movie horizontally, vertically and diagonally freely. The picture represents the same.Can you place 8 queens on the board in a manner that none of the queens can attack each other?
See the image to find out how it can be done.
Can you find out the missing number?
? 4 5 3 5
9 5 7 10 3
4
The number in the upper row indicates the number of letters in the alphabetical form of the number below.
9 = Nine = four letters
Therefore the missing number is 4.
Below, you can see three complete equations and one incomplete. Based on the three complete ones, can you complete the incomplete one?
5 $ 4 $ 3 $ 9 = 4215
6 $ 9 $ 2 $ 6 = 3816
4 $ 7 $ 3 $ 3 = 1122
7 $ 2 $ 7 $ 4 = ____
2418 is the answer.
The algo that has been used here is
A $ B $ C $ D = [first digit of (A * D)] [last digit of (B * C)] [first digit of (B * C)] [last digit of (A * D)]
Using the same algo,
7 $ 2 $ 7 $ 4 = [first digit of (7 * 4)] [last digit of (2 * 7)] [first digit of (2 * 7)] [last digit of (7 * 4)]
= 2418
You are provided with a grid (as shown in the picture). Can you fill the squares with numbers 1-8 in a manner that none of the two consecutive numbers are placed next to each other in any direction (vertically, horizontally or diagonally?)
This problem can be solved in four different ways. The picture shows you one of the solutions. Can you find out the other three?
B is to the North-East of D; A is to the North-East of C; C is to the West of D; E is to the South-West of D and to the South of C; and A is to the north of D and in line with B.
You have to find out that in which direction of E is B located. Can you do it ?
As we draw on a paper (see the figure) we find out that B is located on the North-East of E.
Calculate a six digit number that is smaller than 500000 such that the sum of its digits is 43 exactly.
499849
Let us begin with the maximum sum of a digit under 500000. Of course it will be the sum of 499999.
4 + 9 + 9 + 9 + 9 + 9 = 49.
Now, the required number must be close to it.
Rooting 499999, we get 707.106
Taking the square of 707, we get 499849.
4 + 9 + 9 + 8 + 4 + 9 = 43
Thus, the required number is 499849.
Raman was born on March 5, 1970. Prakhar was born 25 days before Raman. The year when they took birth, the Republic Day fell on Monday.
Can you find out on what day was Prakhar born?
Prakhar was born on Sunday.
Prakhar was born 25 days before Raman and thus the birth date of Prakhar will be 8 Feb 1970.
Republic Day was on Monday.
Number of days from 26 January till 8 February = 13
After 13 days of Monday, it will be Sunday.