Mind Boggling

15/06/2019 Neuroscientist unveils series of mind-boggling challenges for launch of new BBC show | Daily Mail Online
A new BBC game show is to pit families against one another with a series of brain tests designed to assess
different types of intelligence - but are you up to passing any of the cognitive challenges?
The Family Brain Games, hosted by Dara Ó Briain, will follow eight different families from all walks of life as
they come together in a specially designed ‘games lab’ to compete in the ultimate test of intelligence.
Questions are designed to go beyond traditional ideas about how to measure brain power, such as individual IQ.
They will instead explore other measures including verbal ability, memory ability and even group intelligence.
Dr Adam Hampshire, a neuroscientist at Imperial College London, is one of the brains behind the tests. He claims
that traditional IQ testing is too simplistic and cannot properly assess the many different types of intelligence.
So he has compiled a series of tests, called the Cognitron, that will probe a range of more surprising areas
including communication, strategy and risk - now considered critical components of 21st century intelligence.
The large-scale citizen science project, that anyone can log on and try, forms part of Dr Hampshire's research into
areas including memory and social-emotional intelligence, and how this develops through the lifespan.
Example questions from his test, used as a basis for the new BBC show, are available below. The answers are
revealed further down the page.
1. Word ladder
Find the words related to the clues. Each word can only differ from the one above by a single letter.
Find the words related to the clues. Each word can only differ from the one above by a single letter
https://www.dailymail.co.uk/news/article-7136589/Neuroscientist-unveils-series-mind-boggling-challenges-launch-new-BBC-show.html 1/27
Find the words related to the clues. Each word can only differ from the one above by a single letter
2. Blocks task
List the numbered blocks that should be removed to match the silhouettes.
You can remove the blocks. You cannot rotate or slide the sideways.
Blocks will fall into different position if you remove the ones beneath them.
List the numbered blocks that should be removed to match the silhouettes. You can remove the blocks. You cannot rotate or
slide the sideways. Blocks will fall into different position if you remove the ones beneath them
3. Latin square
Identify the letters that go where the question marks are when the grids are completed.
When completed, the same letters are placed in all rows and columns.
Each letter can appear only once in a given row or column.
(a) Identify the letters that go where the question marks are when the grids are completed. When completed, the same letters
are placed in all rows and columns. Each letter can appear only once in a given row or column
(b) Identify the letters that go where the question marks are when the grids are completed. When completed, the same letters
(c) Identify the letters that go where the question marks are when the grids are completed. When completed, the same letters
(d) Identify the letters that go where the question marks are when the grids are completed. When completed, the same letters
4. Weights
Number reasoning - identify the heaviest shape in each panel.
(a) Easy: number reasoning - identify the heaviest shape in each panel
(b) Moderate: number reasoning - identify the heaviest shape in each panel
(c) Hard: number reasoning - identify the heaviest shape in each panel
(d) Hard: number reasoning - identify the heaviest shape in each panel
5. Path finder
Work out the minimum number of moves required to navigate the Seeker (S) into the target square (X).
Both the Seeker and the Blocker (B) can be moved either horizontally or vertically.
Once they start moving, they cannot stop until they hit an edge, a black square or each other.
You can only move one piece at a time but they can be moved in any order
The pieces cannot enter a black-filled square, and they cannot occupy the same square
EXAMPLE (can be solved in four moves): Work out the minimum number of moves required to navigate the Seeker (S) into the
target square (X). Both the Seeker and the Blocker (B) can be moved either horizontally or vertically. Once they start moving,
they cannot stop until they hit an edge, a black square or each other. You can only move one piece at a time but they can be
moved in any order The pieces cannot enter a black-filled square, and they cannot occupy the same square
(a) Moderate: Work out the minimum number of moves required to navigate the Seeker (S) into the target square (X). Both the
Seeker and the Blocker (B) can be moved either horizontally or vertically. Once they start moving, they cannot stop until they
hit an edge, a black square or each other. You can only move one piece at a time but they can be moved in any order The
pieces cannot enter a black-filled square, and they cannot occupy the same square
(b) Hard: Work out the minimum number of moves required to navigate the Seeker (S) into the target square (X). Both the
(c) Hard: Work out the minimum number of moves required to navigate the Seeker (S) into the target square (X). Both the
6. Analogical reasoning
Identify the panel that comes next in each sequence.
(a) Easy: Identify the panel that comes next in each sequence
(b) Moderate: Identify the panel that comes next in each sequence
(c) Moderate: Identify the panel that comes next in each sequence
(d) Hard: Identify the panel that comes next in each sequence
7. Relational matrix task
Identify the cell that is the odd one out in each grid.
A set of rules define the conjunctions of shapes and letters in each matrix.
One of the nine cells in each matrix breaks the rules.

Work out the rules and identify the odd one out.
Note, there is only ever one odd one out.
(a) Easy: Identify the cell that is the odd one out in each grid. A set of rules define the conjunctions of shapes and letters in
each matrix. One of the nine cells in each matrix breaks the rules. Work out the rules and identify the odd one out. Note, there
is only ever one odd one out
(b) Easy: Identify the cell that is the odd one out in each grid. A set of rules define the conjunctions of shapes and letters in
(c) Hard: Identify the cell that is the odd one out in each grid. A set of rules define the conjunctions of shapes and letters in
(d) Diabolical: Identify the cell that is the odd one out in each grid. A set of rules define the conjunctions of shapes and letters
in each matrix. One of the nine cells in each matrix breaks the rules. Work out the rules and identify the odd one out. Note,
there is only ever one odd one out
8. The Hampshire tree task
Work out the minimum number of moves required to arrange the beads into the correct configuration (pictured
top).
Only one bead can be moved at a time.

The beads slide on and off via the ends of the branches.
They cannot move past each other on a branch.
They must be moved from branch to branch, not placed to the side.
THE CORRECT CONFIGURATION: This is what you are trying to achieve in the below tests.
(a) Easy: Work out the minimum number of moves required to arrange the beads into the correct configuration (pictured top).
Only one bead can be moved at a time. The beads slide on and off via the ends of the branches. They cannot move past each
other on a branch. They must be moved from branch to branch, not placed to the side
(b) Moderate: Work out the minimum number of moves required to arrange the beads into the correct configuration (pictured
top). Only one bead can be moved at a time. The beads slide on and off via the ends of the branches. They cannot move past
each other on a branch. They must be moved from branch to branch, not placed to the side
(c) Moderate: Work out the minimum number of moves required to arrange the beads into the correct configuration (pictured
(d) Hard: Work out the minimum number of moves required to arrange the beads into the correct configuration (pictured top).
Only one bead can be moved at a time. The beads slide on and off via the ends of the branches. They cannot move past each
other on a branch. They must be moved from branch to branch, not placed to the side
(e) Diabolical: Work out the minimum number of moves required to arrange the beads into the correct configuration (pictured
ANSWERS: Were you able to get everything right?

1. Word Ladder 6. Analogical reasoning
Easy: broad, brood, broom, groom, gloom, gloam. a. 2
Hard: shear, sheaf, shelf, shell, swell, dwell. b. 3
2. Blocks task c. 3
a. 1, 5, 9, 10, 11 d. 4
b. 1, 2, 4, 6, 11, then 5 or 9 & 8 7. Relational matrix task
c. 1, 6, 9, 10, 11 a. centre bottom
d. 1, 4, 5, 9, 11 b. right top
3. Latin square c. centre top
a. Y d. centre top
b. F 8. Hampshire tree task
c. H a. 7
d. G b. 10
4. Weights c. 7
a. ball d. 17
b. ball e. 14
c. star
d. square
5. Path finder
a. 8
b. 7
c. 7
The Family Brain Game airs Monday to Thursday at 8pm on BBC Two from Monday, June 17. It is produced by Label1.

Mind Boggling

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Mind Boggling

Uploaded by

Copyright:

Available Formats

15/06/2019 Neuroscientist unveils series of mind-boggling challenges for launch of new BBC show | Daily Mail Online

Number reasoning - identify the heaviest shape in each panel.

(b) Moderate: number reasoning - identify the heaviest shape in each panel

(c) Hard: number reasoning - identify the heaviest shape in each panel

(d) Hard: number reasoning - identify the heaviest shape in each panel

Identify the panel that comes next in each sequence.

(a) Easy: Identify the panel that comes next in each sequence

(b) Moderate: Identify the panel that comes next in each sequence

(c) Moderate: Identify the panel that comes next in each sequence

(d) Hard: Identify the panel that comes next in each sequence

7. Relational matrix task

One of the nine cells in each matrix breaks the rules.

8. The Hampshire tree task

Only one bead can be moved at a time.

ANSWERS: Were you able to get everything right?

Easy: broad, brood, broom, groom, gloom, gloam. a. 2

Hard: shear, sheaf, shelf, shell, swell, dwell. b. 3

c. 1, 6, 9, 10, 11 a. centre bottom

3. Latin square c. centre top

b. F 8. Hampshire tree task

5. Path finder

You might also like