![]() |
Binary puzzle (Colour contact puzzle) |
The binary system is the basis for the following puzzle, designed by C.J. Bouwkamp. You are given 16 squares. Each square is again divided into 4 squares
and represents a binary number from 0 - 15. These squares are either
white (0) or green (1) as illustrated below. There are 50 unique solutions to this puzzle. As a special challenge, try to built the puzzle without rotating the squares. |
|||
![]() |
![]() |
![]() |
![]() |
| 0 = 0000 | 1 = 0001 | 2 = 0010 | 3 = 0011 |
![]() |
![]() |
![]() |
![]() |
| 4 = 0100 | 5 = 0101 | 6 = 0110 | 7 = 0111 |
![]() |
![]() |
![]() |
![]() |
| 8 = 1000 | 9 = 1001 | 10 = 1010 | 11 = 1011 |
![]() |
![]() |
![]() |
![]() |
| 12 = 1100 | 13 = 1101 | 14 = 1110 | 15 = 1111 |
| Problem from: van Delft, Pieter and Botermans, Jack. 1997. Denkspiele der Welt. Heinrich Hugendubel Verlag, München |
||
![]() |
Return to Brain Teaser Index | |