Advertisement
TREASURE HUNTING
This is a treasure-hunting game. The number of
treasures can be specified in the range from 1 to
9. The point of this game is to get the specified
number of treasures with the minimum number
of key strokes. As you manipulate keys, hints are
given by numbers to help you find the treasures.
••JIU4M,tl
~\·,
.·,
.
)-'""\..
~,_;
·
... --::-;:;_,
..
<'
• .. .::. l_
'
''
'
,
.... '.L-i.:.
\_i)-
-
(_,.."1.-·
,
The specified number of treaures are hidden somewhere in
15
x 7 matrices.
When the program is started, it asks for the number of treasures to be hidden. Input
any number from 1 to 9. The greater the number, the more. difficult the game becomes.
At first, try it with 3 to 5 treasures.
The program then asks for the values of X (horizontal axis) and Y (vertical axis). Input
the appropriate values. The maximum value of X is
6,
and the maximum value of
Y is
__ 14.
Then, the_program draws lines to indicate,.the _data at the intersecting point e>f.X -"-·
.. ~nd Ytonttt;s'creen. .
·:-"·,
":~~:;~i?iI}f . . . . · _ . . : ' ...
~; : ~ : : f
{,¥:
c'
:N-f~c;~;;,•
;frt,t:·
0
2
3
2 . 3
4
5
6 , 7 , 8
9
10 . 11
12
13
14
4
1-------------,-
5
6
For example, when 5 is input in X and 4 is input in Y, the screen appears as shown in
the diagram, above. At the intersecting point, the following is displayed:
0 -+ No treasure can be found on lines X=5 or Y=4.
1
-+
A treasure can be found on either of the two lines.
2 -+ Two treasures can be found on either or both of the two lines.
3 -+A.total of three treasures can be found on either or both of the two lines.
4-15
-+
The Corresponding number of treasures
can
be found on either or both of
the two lines.
$ --,.
A treasure is located at the intersecting point.
When you find all the hidden treasures, the program outputs the scores. The sco~es
~
. .
indicate the number of key-strokes required to find all the treasures. Thus, the lower_ ..
the scores, the better.
Advertisement
