Enemy Challenge

our enemy challenges you to play Russian Roulette with a 6-cylinder pistol (meaning it has room for 6 bullets). He puts 2 bullets into the gun in consecutive slots, and leaves the next four slots blank. He spins the barrel and hands you the gun. You point the gun at yourself and pull the trigger. It doesn't go off. Your enemy tells you that you need to pull the trigger one more time, and that you can choose to either spin the barrel at random, or not, before pulling the trigger again. Spinning the barrel will position the barrel in a random position.

Assuming you'd like to live, should you spin the barrel or not before pulling the trigger again?




Similar Logic Riddles

On a bright sunny day, two fathers took their son fishing in the lake. Each man and son were able to catch one fish. When they returned to their camp, there were only three fishes in the basket. What happened?

PS: None of the fish were eaten, lost, or thrown back.

Asked by Neha on 05 Mar 2023


A man is trapped in a room. The room has only two possible exits doors. Through the first door there is a room constructed from magnifying glass. The blazing hot sun instantly fries anything or anyone that enters. Through the second door there is a fire-breathing dragon. How does the man escape?

Asked by Neha on 09 Jan 2021

Find The Next Number in the series:

12 13 15 17 111 113 117 119 123 ?

Asked by Neha on 01 Dec 2023


There are hundred red gems and hundred blue gems. The blue gems are priceless while the red gems equal wastage. You have two sacks one labeled Heads and the other Tails. You have to distribute the gems as you want in the two sacks. Then a coin will be flipped and you will be asked to pick up a gem randomly from the corresponding sacks.

How will you distribute the gems between the sacks so that the odds of picking a Blue gem are maximum?

Asked by Neha on 29 May 2023

Two friends Smith and Andrew were talking about the bravery of their families. Smith told great stories about his courageous grandfather who fought for Britain in "World War I". Andrew told that his grandfather was so brave that in 1919 just after the war he was honoured with a bravery medal with the words "For our Courageous Soldiers In World War I" embedded into it. Smith knows that his friend is lying. How?

Asked by Neha on 09 Mar 2026

You have four chains. Each chain has three links in it. Although it is difficult to cut the links, you wish to make a single loop with all 12 links. What is the fewest number of cuts you must make to accomplish this task?

Asked by Neha on 23 Apr 2022


I have thought of a number that is made up by using all the ten digits just once. Here are a few clues for you to guess my number:

First digits is divisible by 1.
First two digits are divisible by 2.
First three digits are divisible by 3.
First four digits are divisible by 4.
First five digits are divisible by 5.
First six digits are divisible by 6.
First seven digits are divisible by 7.
First eight digits are divisible by 8.
First nine digits are divisible by 9.
The number is divisible by 10.

Can you find out the number ?

Asked by Neha on 12 Mar 2023

In the addition below, all digits have been replaced by letters. Equal letters represent equal digits and different letters represent different digits.
ABCABA
BBDCAA
ABEABB
ABDBAA
------- +
AAFGBDH
What does the complete addition look like in digits?

Asked by Neha on 04 Jul 2023

Which is Odd One Out and why?

4377

3954

9862

8454

9831

Asked by Neha on 09 Jan 2024


The first box has two white balls. The second box has two black balls. The third box has a white and a black ball.

Boxes are labeled but all labels are wrong!

You are allowed to open one box, pick one ball at random, see its colour and put it back into the box, without seeing the colour of the other ball.

How many such operations are necessary to correctly label the boxes?

Asked by Neha on 24 Jun 2021

Hot Articles

Amazing Facts

No Solution

In 2007, a puzzle was released and $2 million prizes were offered for the first complete solution. The competition ended at noon on 31 December 2010, with no solution being found. Wiki