Log In

Euclid: The Game

Posted on: June 21st, 2014 by

I came across a game where your knowledge of Geometry will help you solve puzzles. It's called Euclid: the game and can be accessed here.

It consists of 20 levels of Geometry puzzles. Enjoy.

Breaking the back of a camel

Posted on: April 7th, 2014 by

A camel is loaded with straws until it's back breaks. Each straw has a weight uniformly distributed between 0 and 1, independent of other straws. The camel's back breaks as soon as the total weight of all the straws exceeds 1. Find the expected weight of the last straw that breaks the camel's back. (knowledge of probability required)

- via Mind your decisions

Die and pi

Posted on: March 31st, 2014 by

Estimate the value of pi using a 6 sided die.

- via Goldman Sachs interview, reposted in CSE blog

Car wheels

Posted on: March 30th, 2014 by

A car has 4 tires and 1 spare tire. Each tire can travel a maximum distance of 20000 miles before wearing off. What is the maximum distance the car can travel before you are forced to buy a new tire? You are allowed to change tires (using the spare tire) unlimited number of times.

- via Gpuzzles


Posted on: March 25th, 2014 by
Comments Requested

What is the largest square table that you can cover completely using 3 square napkins of side 1 unit? You cannot tear the napkins, but you can fold them or overlap them, and the napkins are allowed to drape over the side of the table.

- via Mind your decisions.

Form a triangle

Posted on: March 23rd, 2014 by

You certainly can make a triangle from 3 unit toothpicks called a, b and c (each being a side opposite angles A, B, and C respectively.

But what if you were to:
Cut a piece from b and burn it.
Cut a piece from c and burn it.
Leave a alone.
What are the probabilities that you will be able to form the following (using the entire remaining lengths as sides):
No Triangle
A Right Triangle
An Acute Triangle
An Obtuse Triangle.

- via Sid Hollander

Hat puzzle

Posted on: March 20th, 2014 by

There are 3 people each wearing either a white or a black hat. They can see everyone's hat except their own. They must design a strategy so that they can maximize the chances of success of at least one person guessing the hat color correctly and no one guessing wrong. They cannot talk to each other after the hats have been placed on their heads. What is the best strategy?

- via Daily Brain Teaser


Posted on: March 18th, 2014 by

You want to pair 2n students into n pairs of 2 students each. You like to do it on consecutive days so that no two students are paired together twice. What is the maximum number of consecutive days for which you can achieve such a pairing?

jumping coins

Posted on: March 16th, 2014 by
Comments Requested

There are n coins placed in a row. The goal is to form n/2 pairs of them
by a sequence of moves. On the first move a single coin has to jump over
one coin adjacent to it, on the second move a single coin has to jump
over two adjacent coins, on the third move a single coin has to jump over
three adjacent coins, and so on, until after n/2 moves n/2 coin pairs are
formed. (On each move, a coin can jump right or left but it has to land on
a single coin. Jumping over a coin pair counts as jumping over two coins.
Any empty space between adjacent coins is ignored.) Determine all the
values of n for which the problem has a solution and design an algorithm
that solves it in the minimum number of moves for those n’s.

- via Algorithmic puzzles

What does this equation mean?

Posted on: March 14th, 2014 by


- via Gpuzzles

{"result":"error", "message":"You can't access this resource as it requires an 'view' access for the website id = 1."}