1500 CLS:CLEAR1000
1510 'KEN REILLY
1520 PRINT:PRINTTAB(13)"=*=   THE CHECKERBOARD PROBLEM   =*="
1530 PRINT:PRINT"YOU ARE GIVEN A CHECKERBOARD , AND  31  TILES. EACH TILE WILL   COVER TWO ADJOINING SQUARES."
1540 PRINT:PRINT"OBVIOUSLY  31  TILES WILL COVER ONLY   62  OF THE  64  SQUARES":PRINT
1550 PRINT"THE QUESTION IS . . . CAN THE TILES BE SO PLACED , AS TO COVER  ALL EXCEPT THE TWO OPPOSITE , DIAGONAL SQUARES MARKED ' A '"
1560 PRINT:PRINT"YOUR ANSWER MUST BE ONE OF TWO .  (1) YES ,BECAUSE OF.......    OR (2) NO , BECAUSE OF THE FACT......."
1570 PRINT:PRINT:INPUT"TO CONTINUE , PRESS ENTER";U
1580 CLS
1590 A$=STRING$(3,128):B$=STRING$(3,191)
1600 C$=CHR$(191)+A$+B$+A$+B$+A$+B$+A$+B$+CHR$(191)
1610 D$=CHR$(191)+B$+A$+B$+A$+B$+A$+B$+A$+CHR$(191)
1620 PRINTSTRING$(26,176)
1630 FORX=1TO4:PRINTC$:PRINTD$:NEXT
1640 PRINT@66,"A";:PRINT@535,"A";
1650 PRINT@576,STRING$(26,131)
1660 PRINT"THE TILES  ";STRING$(6,191)
1670 PRINT:PRINT"THE LOGICAL SOLUTION IS  ?";:INPUTU$
1680 INPUT"TO RETURN TO MENU , PRESS ENTER";U
1690 RUN"SUPEMENU
