Maximum — RetroAllGames

Descripción

Todavía no hay descripción para este juego.

Carátulas (PAL / USA / JAP)

Capturas de pantalla

Sin capturas subidas todavía.

Mapas

Sin mapas subidos todavía.

Manual

Sin manual disponible todavía.

Trucos y secretos

Todavía no hay trucos publicados.

💡 Enviar un truco o secreto

Cargadores (POKEs y líneas BASIC)

REM =====            FOR C128 ONLY        ===========        •220 NEXTF.E.D

■ 10 GRAPHIC1,1:CHAR1,0,5,"CHARACTER:":GET                      •230 FORI=1T09:IA(I)=0:NEXTI

 ,A$:SSHAPEA$,0,O,20,2O:SPRSAVA$,l:MOVSPR

 l,150,100:SPRITEl,l,4,0,l,l,0:GOT010                             Line 100 creates all possible three-number combinations

                                                                of nine digits. For each combination, lines 110-140 create

 an array IB of the remaining six numbers. From this array,

 lines 150-200 calculate all possible three-digit combinations

 (array X) along with the remaining three-digit combina

 tion (array Y). It turns out that ihe final answer is found

 and displayed right away. Since all other squares are

 checked, the answer is printed and the computer thinks

 quietly for seven more minutes, checking all other possi

 bilities, then stops.

 You may easily modify Jim's program to find the mini

 mum sum of row-products (214) by adding line 90 M=630,

 and by changing the ">" in line 210 to "<". Each time a

 square with a result smaller than the previous minimum

 is found, it is displayed on the screen. The final display

 is the answer. Is this a unique result or are there several

 distinctly different squares that give this minimum?

 Here is a list of all the readers not already mentioned

 this month who sent solutions or problems to Commodores.

 Please be sure to include your address with your listing.

The envelopes are discarded and some readers' addresses

go with them.

Disponible en

PC WINDOWS

Ficha técnica

Año

2023