A sequence consists of four squares already. The
fifth one is missing. It can be chosen from a number of options. The
task is to pick up the right one. For this you have to unveil the
sequence's prime clue.
Six shapes, each arranged of unit cubes, are
duplicated into a twin-set. Definitely, the twin-set at first glance
doesn't look like the original one, but it still contains the same
shapes. The goal is to discover all six pairs.
There are four snakes interwoven in a cross-like
shape. Each one of a different color: black, blue, green and red. The
challenge is to spot the shortest of them.
Overlapped circles form different color areas.
The challenge is by using simple calculations to find two identical
areas. The approach can be easy and clever simultaneously.
There are several squares of different sizes hidden in a simple shape. You
goal is just to identify the exact number of them, not overlooking even a
little single square.
Six snapshots of the same thing just taken from different positions. One
of them is wrong. Matching the 2D snapshots with the 3D thing can you
figure out which one it is?
It is known there is a rule connecting different patterns in each given
row of their array. The challenge is to figure out what is the rule and
then properly applying it complete the last row of them.
It is said this set of strange symbols stands for a month. What should
be the possible approach to break this "code" down and thus, decipher
what month it can be? Will it be a forthright approach or more
complicated?
Two almost similar spirals... One of them consists of a single piece of
rope, while the other is formed with two separate pieces of rope. The
question is which is which?
It's the visual one but it's not an illusion. Count how many
dot-per-corner squares are hidden in the given figure and don't let the
answer square your error.
Do you like puzzles with counting shapes hidden in some pattern? Then this
one is for you. Its simple pattern may give you new practice or just bring
you some relax.
A pentagon divided with five lines proposes us a grid where several
triangles are hidden. How fast can you count all of them? Is any method
required to do this?
