Top 10k strings from hanoikin.tap in <root> / bin / z80 / software / ZxTapGames.zip / games /

Back to the directory listing

   2 HANOI KING
   1 zzzzzzzzzzzzzzzzzzzzzzzzzzzzzz
   1 f$="To which pillar?(1
   1 f$="How many rings? (3
   1 f$="From which pillar?(1
   1 e$="    "+
   1 a$(p,q)=":"
   1 a$(p,q)<a$(m,n)
   1 a$(m,n)=":"
   1 WELL  DONE
   1 PLEASE WAIT
   1 LOGO      
   1 HK        
   1 GGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGFFFFFFFFFFFFFFFFFFFFGGGGGGGGGGGGFFFFFFFFFFFFFFFFFFFFGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGEEEEEEEEEEEEEEEEEEGGGGGGGGGGGGGGEEEEEEEEEEEEEEEEEEGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGG
   1 GGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGCCCCGGGGGGGGGGGGGGGGGGGGGGGGGGCCCCCCCCGGGGGGGGGGGGGGGGGGGGGGGGCCCCCCCCGGGGGGGGGGGGGGGGGGGGGGGCCCCCCCCCCDEDEDEDEDEDEDEDEDEDEGGCCCCCCCCCCEDEDEDEDEDEDEDEDEDEDGGCCCCCCCCCCGGGGGGGGGGGGGGGGGGGGGGCCCCCCCCCCGGGGGGGGGGGGGGGGGGGGGGGCCCCCCCCGGGGGGGGGGGGGGGGGGGGGGGGCCCCCCCCGGGGGGGGGGGGGGGGGGGGGGGGGGCCCCGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGG
   1 ;a;" RINGS",
   1 ;a;" RINGS"'';
   1 ;"You have solved the puzzle!!!!!!"'
   1 ;"THE TOWERS OF HANOI"
   1 ;"SWITCH OFF THE TAPE RECORDER":
   1 ;"SORRY, YOU HAVE HAD 999 MOVES!!!":
   1 ;"Press  ENTER";
   1 ;"PROGRAM LOADING";
   1 ;"PRESS  ENTER":
   1 ;"OUTPUT TO THE PRINTER(Y/N)?":
   1 ;"MOVE ";n;
   1 ;"IN THE MINIMUM MOVES: HANOI KING"
   1 ;"HANOI KING"'';
   1 ;"HALL OF FAME"'';
   1 ;"DO NOT SWITCH OFF THE TAPE":
   1 ;"+LARGE RING ON A SMALLER+":
   1 ;"**NO RING ON THAT PILLAR**":
   1 ;"*******WRONG  INPUT*******":
   1 ;"********TRY AGAIN********":
   1 ;"          ":
   1 ;"           ";
   1 ;"            ";
   1 ;"                                                              "
   1 ::9::8::7::6::5::4::3::2::1
   1 321::::::E
   1 )=a$(m,n):
   1 )="F")+(f$(1
   1 )=":::::::::"(10
   1 )="987654321"(10
   1 (w+114)*256+
   1 (w+113+3*m+n)":
   1 (s/256))":
   1 (p$);" Hex ";
   1 ((n+1)/2)":
   1 ''m;" RINGS ";
   1 ''"You may have up to 999 moves in any one game."''"You begin by choosing how many  rings you want to use."
   1 ''"The Towers of Hanoi is a logicalproblem. There are three        pillars. On the first of these  is a series of rings. You have  to transfer them to the third   pillar so that they are in the  original order."''"You must move only one ring at atime and must not place a largerring on top of a smaller."
   1 "w+16*(f-3)+n":
   1 "s=2^a-1";
   1 "You have the best score at this level."''"Please type in your name        (Maximum of fourteen letters.)"';
   1 "START THE TAPE":
   1 "HANOI KING"
   1 "4*(o=1)+14*(o=2)+24*(o=3)":
   1 "(w+16*(a-3))":
   1 "(w+114)",
   1 "(w+113)":
   1 "(w+113)",a:
   1 "(n-(n>6)*6)"
   1 "''"PRESS :"''" 
   1  TO STOP & TAKE OVER     HOLD DOWN 
   1  TO PAUSE":
   1  John Morgan 1983
   1  - START A NEW GAME"''" 
   1  - SAVE CURRENT POSITION "''" 
   1  - RETURN TO THIS MENU":
   1  - PRINT MOVES"''" 
   1  - LOAD PREVIOUSLY TAPED GAME"''" 
   1  - INSTRUCTIONS"''" 
   1  - CONTINUE FROM WHERE             YOU LEFT OFF"''" 
   1  - AUTOMATIC REPLAY"''"