Matrix67.

com » ^ ± ^ t ^ I Q I B ^ ^ : Haselbauer-Dickheiser Test

* Our most difficult te st

Measures IQ scares up to 1 8 0 +

* Recommended far persona having an

IQ in the top one percent of the population

We have designHd this high-ceiling test: ta be bd challenging that gifted individuale will
get: average scores, and only geniuses will be able ta achieve the highest scares. This
tsHt is deceptively difficult and is, therefore, only recommended Far persons whose IQs
are in tiie top ana percent and above. Considering that the average person who
successfully completes this test answers less than two questions correctly, and that
the average professional mathematician or physics professor would barely be able to
answer half of them correctly, you can see the extremely difficult nature of this test.
Of the hundreds of people who complete this test each week, nobody has been able to
achieve a perfect score. All of the Society’s tests tend to be more difficult than the
average IQ test, hut this one in particular has the unique ability to determine IQ scores
in the extreme high-end of the spectrum and has the one of the highest ceilings of any
test currently available.

Although a mastery of advanced mathematics is not required, proficiency in general

areas of math will be beneficial in answering many of the questions. Understanding the
warding of the problem, which is occasionally rather intricatBj end the ability to deduce
various complex co n c e p tS j are also essential. This test afferà a wide variety of different
types cf questions and is well suited tc the assessment al1 general intelligence.

The use of reference rnsiterials, books, calculators, and computers ara permitted. We
ask that you da not share your answers in any public forum in order ta maintain the
integrity of the test. There is no penalty for wrong answers so it is to your advantage
to guess whenever you ara unsure of an answer.

This test has been developed and copyrighted by Nsitlhan Haselbauer and Mike Oickhelsar
and is the exclusive property of the International High IQ Society. The accuracy of both
the questions and the answers has been verified by members of the International
Intelligence Testing Committee. The te st results are constantly reviewed by the
Society to ensure the mast accurate score possible.

H A S ELB A U E R - D IC K H E IS E R T E S T FO R EX C EPTIO N A L IN T E LLIG E N C E

PR IN TA B LE V ERSIO N
Under Page Setup, set your browser to "print to page if possible"

1.
2.
3.
 These three circles below all have bfue dots or their circum ference
which are connected by straight lines. These Eines divide the circles
into smaller regions. The first circle, with two blue dots, is separated
into two regions. The second circle, with three blue dots, is separated
into four regions. The third circle, with four blue dots, is separated
into 8 regions.

Given a circle where seven blue dots are placed anywhere on its
circum ference, what would be the maximum number of regions into
which it could be divided?

4.
5.

DETERMINE THE MISSING CODE:

6.
 Each letter has an associated numerical value attached to it, and the total of all the letters
equals the physicist's total value. For example, if the letters G, L ; A, S, E ( and R had the
values 12, 7, 9, 14, 21, and 5, respectively, American physicist Glaser would have a
numerical value of 68.

Your objective is to figure out what the last physicist--Feynman--should be valued.

ROENTGEN 104 PERRIN 98

LO REN TZ nos R ICHA RD SO N *105
CURIE 69 H E ISE N B E R G 1 IB
MICHELSON nos SC H R D O IN G ER 1 EB
LIPPMAN BS CHADWICK 114
MARCONI 90 A N D ER S O N 127
KAMERLINGH 1SG DAVISSON 103
PLANCK 9B FERMI 57
ST A R K 60 STERN 70
EIN STEIN 94 B LO C K 73
BOHR 47 ZER N IKE 99
MILLIKAN 103 C H ER E N K O V 109
5IEQBAHN B7 FEYNMAN

7.
 The following are the first twelve terms of a sequence generated from the diagram
Determine the 1000th term.

2 21 5 0 7 3 121 1 3 1 1 7 5 1 9 2 1 9 7 2 5 4 3 2 7 3 4 4 ...

8.
 Use the image below to determine the next three items in the sequence

Q P O N M ? ? ?

9.
 A common phrase has been encrypted, The objective is to decipher the cryptogram
and type the last word of this phrase In the answer box.

AFFDXVXAAAGXXDF
XXFGGAFAFAGGXFG
AAXAAXXFXXFFFGG
AFXGGVG GAFFAAFS
V G G A X F X G X X F FA A F
XDFFFAVFD XFD D XF

11.
 O n the planet Q g, the natives love to play the 5 0 m ? pi Q u e st, Q u c s s is played on a board co n sistin g of 61
hexagonal s p a c e s , se v e r of w hich are Im passable.

Two of the pieces In Qansss Aie the Warrior

and the WarpGate, which obey Am following
nit**:
1, W a rrio rs rlU y movO u p td i f r v M ip A C a s ih
Quess
any direction,
2. WarpGates may move only one space In
any direction.
3- Neither pie-ce can move to Or through a
s p a c e that Is im p assab le o r o ccu p ie d by
ano th er p iece, with one excep tio n noted In
rule 4,
4. Warriors may enter a space occupied by a
WarpGate, but then must "warp" {teleport) to
anotherW arpCttc on the beard and continue
their m ove in the sam e direction. W arriors
cannot warp to the same gate they entered,..
they must always warp to a different gate.
5. Warriors may not end their move in a
space occupied by a WarpGete- That is,
Warriors can only pass through WarpGates,
net land en them.

The diagram above show s the Quess board, with the following features illustrated:
1) Impassable spaces are marked in solid black.
2f A Warrior is shewn as the large red circle, and WarpGates are shown as blue stars.
3 ) R e d linos in d ic a te th e p â th $ th a t th e W a rrio r c o u ld t a k e on its m o v e w ith o u t u s in g W a ro G a tc s , w ith $ h ia ll
red circles Indicating the spaces to which Jt could move.
4) Blue lines indicate the paths thal ihe Warrior could take alter warping, with small blue circles indicating
the spates to which it could move.
3) Note that given the rules above, 991 legal spaces to which the Warrior could move are Indicated by small
red and blue circles. No other spaces are legat destinations.

Determine the minimum number ol WarpGates that allow Only four Warriors to attack the entire G uess board.

12.
 Determine the next item in the sequence. Express your answer as coordinates for
the grid squares containing black circles^ in increasing alpha-numeric order.
[For example, the 5th item in the sequence would be A4C4C5D3 )

W Hll
iE E ii
■J V
m
iT l^
I
J*.r J V
F
E
D

B ___Lj
_ n I
C
B
A
LJ ? r
I '
1 2 3 4 5 6

13.
 Eight identical sized squares of paper have been placed on top of one
another in a particular order so that they overlap as shown. Enter the
order in which they have been positioned, working from the top sheet
down to the bottom sheet.

D C

E
f 1
G
B
H F

14.
15 .
17 .
 Determine the minimum number of unfolded paper cubes that are required
to completely cover the shaded areas of the grid below, noting the following:

1) Each cube must be com pleted unfolded such that all of its faces perfectly
coincide with a shaded grid square.
2) Unfolded cubes may overlap each other.

Shown to the left of the grid are two of the ways a cube may be unfolded.

18.
 You ar* given a hollow 5 -meter cubic box, a 3-meter blue cube, a 2-meter blue cube* a 1-meter blue cube,
and S9 1 -meter red cubes. Determine the number of unique arrangements of cubes such that A L L of
the cubes are placed completely Inside the box, with each blue cube touching at least one other blue
cube on one or more faces. Consider any two arrangements to be the same if they are mirror images
of each other (with respect to any chosen plane)» or if one may be created from the other «imply by
rotating the entire system of objects.

19.

In Midtown Manhattan there

are 12 buildings connected

W Er
by 17 streets, each one
kilometer !ong. Every night
each street must be cleared
by the streetsweeper* In
order to clean all of the

J r V -T
streets, the streetsweeper
has to travel over some of
the streets more than once.
What is the fewest number of
kilometers he can travel and
still clean every street?

20 .
 Determine the coordinates of the blue piece and black piece that are missing from the
dth item of the sequence. Express your answer in the form H8H6 giving the blue piece
coordinates first.

21.
22 .
23.
 Determine the m issing number

24.

A box contains two coins. One coin is heads on both sides and the other is heads on one side
and tails ort the other. One coin is selected from the box at random and the face of one side is
observed. If the face is heads what is the probability that the other side is heads?

25 .
Consider two breeding strategies of the fictional Furble Dominator FurbÈes can fight for a
breeding territory, and if they win, will be able to rear 10 offspring. An alternative is to share
territory with another Furble which will ai Sow each to rear 5 offspring. Sharers who attempt to
share with dominatore will be forced out of the territory, although they will be able to find a new
territory. Assume sharers become extra cautious after encountering a dominator and so witi
always find another territory to share the next time around, but due to lost time will only be abte
to produce 3 offspring. Dominators are always able to force sharers out of the territory and rear
10 young. Dominators who meet dominators will win 50% of the time. When they lose, they are
not able to reproduce that season due to sustained infuries. Individual Furbles cannot switch
strategies.

With a total population of 2000 dominator and sharer Furbles, how many would you expect to be
dominators?