All contributed routines are using the same algorithm. Its based on the fact, that the intervalls betweem
squarenumbers increase by two, the higher the numbers are getting. The 22 byte implementations were almost
identical  they differed only a bit in register usage etc. I will use Greys routine as an example,
since it is the best documented one.
* ****************************************************************** *
* **** Tiny squareroottable generator ****** (c) gREY in 1997 **** *
* ****** For the first official #amycoders coding competition ****** *
* *** Developed in 5 minutes while watching ST:TNG "Half a life" *** *
* ****************************************************************** *
Sqrt:
lea sqrttab,a0 * load adress of table
moveq #0,d0 * clear d0 (start vlaue = 0)
.outer:
move.w d0,d1 * save d0
add.w d1,d1 * Multiply d1 with 2
* dbra below saves us from adding 1!
.inner:
move.b d0,(a0)+ * fill sqrttab
dbra d1,.inner * as many times as needed
addq.b #1,d0 * increase d0 by 1
bcc.s .outer * as long as d0 =<255! rts * ****************************************************************** *

Psalt and Accede used a very nice trick to save some bytes while setting 3 registers to zero. They took advantage
of the fact, that "fresh" BBSareas are filled with zeros.
; Square root routine by Psalt & Accede
; Made for the #Amycoders sqrt competition.
; Somewhat inaccurate, like sqrt(15)=3
; But fast, and very small...
; bottom and the rts.
; Feel free to use it!
; contact us:
; Accede@hotmail.com
; Psalt@hotmail.com
initsqr lea sqrttab,a0 ;
movem.w (a0),d0/d2/d3 ;
.oloop move.b d2,(a0)+
dbra d0,.oloop
addq.w #2,d3
move.w d3,d0
addq.b #1,d2
.yo bne.s .oloop
rts

Also DigIts routine is quite interesting: He is the only one, who made a routine writing the table backwards !
;;
;; digit @ TBL ...
;;
j: lea sqrttab+65536,a0
moveq #1,d0
move.w #$1ff,d2
.loop1:
move.w d2,d1
.loop2:
move.b d0,(a0)
subq #1,d1
bne.s .loop2
subq #1,d0
subq #2,d2
bge.s .loop1
end: rts

Thats it  the other routines were more or less the same. Download a package with all contributions
right here.
