Answer / desinerd

Detailed Solution for Horse Puzzle:

Divide the set of 25 horses into 5 non-overlapping sets of 5
horses each. Have a race each for all the horses in each
set. This makes it a total of 5 races, one for each set.

Now, have a race for the winners of each of the previous 5
races. This makes it a total of 6 races.

Observe the position of each horse in the 6th race and
correspondingly number the sets. i.e. the set of the winner
of 6th race will be said to be set no. 1 while the set of
the loser of the 6th race will be said to be set no. 5.

Now, possible candidates for the first three positions
exclude the followings:
1. Any horse from set 4 or set 5.
2. Any horse except the winner from set 3,.
3. Any horse except the winner and the 2nd position from set 2.
4. Any horse except the winner, 2nd position and 3rd
position from set 1.

So now we have 6 candidates for top 3 positions. However, we
know that the winner of set 1 is the fastest horse in the
whole group of 25 sets.

So now we have 5 candidates for the second and third
position. What better way to find out who's who than to have
a race of these 5 horses. Race them and this will solve our
problem in just 7 races.

Answer / jai ranjan kumar

No of Races : 7

1 RACE(A) A1 A2 A3 A4 A5
2 RACE(B) B1 B2 B3 B4 B5
3 RACE(C) C1 C2 C3 C4 C5
4 RACE(D) D1 D2 D3 D4 D5
5 RACE(E) E1 E2 E3 E4 E5

LAST TWO CAN BE REMOVED FROM EACH GROUPS.
WE HAVE LEFT WITH 9 HORSES.

6 RACE(F) A1->F1 B1->F5 C1->F2 D1->F3 E1->F4

SUPPOSE (CAN BE GENERIC,ANALYS) FROM RACE(F)

NOW F1(A1) IS FASTES HORSE AMONG 25.
ALL HORSES FROM GORUP B AND E CAN BE ELIMINATED(since E1
and B1 is at 4th and 5th position respectivly). AND ANALYS
A BIT, C3, D2 AND D3 ALSO CAN BE ELIMINATED (since in any
senario C3 will max come 4th, D2->4th and D3->5th). NOW
LEFT WITH 5 HORSES.

7 RACE(G) A2 A3 C1 C2 D1

NUMBER OF RACES REQUIRED : 7

Answer / md

5X5 = 25...
make group of 5 and total 5 such groups ...
race each grup at a time... select winner from each group.
race these 5 winners ... and mark them as their positions

best case: the fastest horse and the 2nd coming horse are
in two different group. Then we can simply say the 2nd
coming horse in the winners' race is the answer.

worst case: the fastest horse and the 2nd coming horse are
in same group. So any from the four except the winner from
the fastest horse's group (say 1st group) may be the 2nd
coming horse.

so need another race.... 4 from 1st group (except winner)
and winner of 2nd group .... who wins is 2nd best.

no of races: 7.

Answer / katie

I was asked this question in microsoft.
The correct answer to find out top 3 horses is 7.
Explaination of Desinerd i.e. Answer#1 seems the most
appropriate.

Answer / joel konecny

Run each horse in a race, always keeping the top two to
compete in the next race, until the last race in which the
top two are identified. So run 8 races instead of 7,
sometimes the simple solution is the best.

Obviously a horse can't run twice in a race. Sometimes when
something is too obvious it makes you think it's a trick
statement.

Answer / mikhailfranco

Obviously horses must be allowed to compete in more than one
race, and they are assumed not to tire as they run races, so
their performance is constant.

Round 1: 5 races of 5
Round 2: 5 winners of Round 1
-> winner is overall 1st place (6 races)
Round 3: 2nd and 3rd places from Round 2,
plus horses that came 2nd & 3rd behind Round 2 1st
placer in
Round 1
plus horse that came 2nd behind Round 2 2nd placer in
Round 1
-> winner is 2nd place overall
-> 2nd place is 3rd place overall

So you can find the winner in 6 races (trivial) and top
three in 7 races.

Answer / aditya kalia

The first soln is correct, but I think its not understandable.
and @ Animesh Sonkar, your soln is correct until 6th race.
In the 7th race, u have eliminated the first rank, the fouth
nd the fifth. But u have raced only 4 horses.. that is whr u
missed. Correct Soln.:-

The fifth horse in the seventh race would be rank 2 horse of
the group which has 2nd rank in the fifth (all winners) race.
So, all the scenarios would be taken care of now.

Eg. after 5th race, let the positions be:

A1 B1 C1 D1 E1 (in order of rank)

now A1 is the fastest.--> eliminate it
D1 nd E1 can't be 2nd nd 3rd.(!!!)
Now we remain with B1 nd C1.

The other horses in the race would be A2 A3 and B2.

So, in every possible case, we can get the first three
positions confirmed.
* We don't need B3 because, B1 nd B2 are already faster than
it (evn after leaving A1), therefore, it can't be 3rd.

* We don't need horse C2 because, B1 nd C1 are already
faster than C2, therefore it is not the contender of top
three positions.

:) :) HAPPY PUZZLING :) :)

Answer / jai ranjan kumar

THE ABOVE SOLUTION IS ALSO WORK FOR WHEN WE NEED TO FIND
FIRST 3 FASTEST HORSES.

the 7th races occures to find 2nd and 3rd positions..

Answer / guest

the horse which crosses the finishes line 2 nd is the second horse.

Answer / hacker

Solution: the answer is 7 races.

Step 1: First, we group the horses into groups of 5 and race each group in the race course. This gives us 5 races.



W11 W12 W13 W14 W15

W21 W22 W23 W24 W25

W31 W32 W33 W34 W35

W41 W42 W43 W44 W45

W51 W52 W53 W54 W55


Step 2:we race the 5 level 1 winners(w11,w21,w31,w41,w51) ans assume winning order of this race is w11,w21,w31,w41,w51

Step 3: BECAUSE WE NEED TOP 3 AND W41 HAS COME 4TH Position that is the reason we don't need to consider W41 W42 W43 W44 W45 and also W51 W52 W53 W54 W55
now we have


W11 W12 W13 W14 W15

W21 W22 W23 W24 W25

W31 W32 W33 W34 W35


Step 4: because we need top 3 then dont need W14 W15 W24 W25 W34 W35

now we have

W11 W12 W13

W21 W22 W23

W31 W32 W33


Step 5: because in 6th race W31 has come on 3rd position that is the reason we do not need to consider W32,W33 and also we will not consider W23
now we have

W11 W12 W13

W21 W22

W31

Step 6: top 1 is already achieved which is W11(winner of 6th race)
remaining are

W12 W13

W21 W22

W31

Step 7: now race W12 w13 w21 w22 w31 to get 2nd and 3rd winner



Hence answer is 7 races.

x^y+y^x=5298.If x and y are integers find x and y.

1 Answers  

If a rook and a bishop of a standard chess set are randomly placed on a chessboard, what is the probability that one is attacking the other? Note that both are different colored pieces.

1 Answers  

Classic: If a bear walks one mile south, turns left and walks one mile to the east and then turns left again and walks one mile north and arrives at its original position, what is the color of the bear

16 Answers   ADP, Microsoft, OSI, TCS, Tech Mahindra,

Submit Answer Users Answer (48) BrainVista Answer Puzzle A Friend Add to Favourite Back to Search Result Hello sajeesh murali ? my Answers ? my Favourites ? Modify Personal Info ? Subscribe ? Logout ? Jigsaw Puzzle ? Join the Dots ? Marbles Game ? Balls Game ? Towers of Hanoi ? Think Number ? Find A Day Brain Teaser No Three Gold (G) coins, three Silver (S) coins and three Copper (C) coins are arranged in a single row as follow: G S C G S C G S C ? Only 2 adjacent unlike coins can be moved at any one time. ? The moved coins must be in contact with at least one other coin in line. i.e. no pair of coins is to be moved and placed away from the remaining ones. ? No coin pairs can be reversed i.e. a S-C combination must remain in that order in its new positionwhen it is moved. What is the minimum number of moves required to get all the coins in following order? C C C S S S G G G Show all moves.

1 Answers  

In rail road there are some stations. Each station should have tickets to all other stations.If they add some new stations they need 46 more tickets.How many stations are there before and after adding the stations?

0 Answers   Infosys,

Four persons A, B, C and D are playing cards.Each person has one card, laid down on the table below him, which has two different colours on either side. The colours visible on the table are Red, Green, Red and Blue. They see the color on the reverse side and give the following

4 Answers   HP, Infosys, TCS, Wipro,

You have 2 identical glass bulbs with you. Bulb manufacturer has mentioned that each bulb might withstand a drop of 200 Feet at maximum. Your task is to find the height at which the bulb breaks ofcourse with minimum number of iterations. Assume that you have 200 blocks of 1 foot each which can be stacked one by one to create a 200 Feet structure to carry out the test.

10 Answers   Wipro,

Major Jasbir is forming five-person Special Task Group. The group must contain one leader, two bomb-experts and two soldiers. P, Q and R are possible bomb-experts. R, S and T are possible leaders. U, V and W are possible soldiers. Also, P and R prefers to work with each other in the same team. T prefers to work only if V works. How many different possible Groups, Major Jasbir can make?

2 Answers  

Find the values of each of the alphabets. N O O N S O O N + M O O N ---------- J U N E

21 Answers   Bhel, CAT, IBM, Infosys, Mind Tree, Wipro,

The cricket match between India and Pakistan was over. ? Harbhajan scored more runs than Ganguly. ? Sachin scored more runs than Laxman but less than Dravid ? Badani scored as much runs as Agarkar but less than Dravid and more than Sachin. ? Ganguly scored more runs than either Agarkar or Dravid. Each batsman scored 10 runs more than his immediate batsman. The lowest score was 10 runs. How much did each one of them score

1 Answers  

there are 5 boxes each of which contains coins. all the boxes except one box contains coins whose weight is 100 grams.(each coin weight is 100gm). only one box contains coins tat weigh 90gm each. u r given a digital balance. in how many trys can u find out which box contains 90gm coins?

8 Answers   Exilant,

Please send SBI Model exam question Paper for Clerical exam sir

2 Answers