+/hovalaag
vliw assembly game solutions
git clone https://git.julia.blue/+/hovalaag
a45abc2
main
1 A=IN1,B=19 2 A=IN1,B=D=A,C=B 3cmpbig: 4 A=B-A,F=NEG() 5 A=B-A,JMPF cmpsmall 6 B=A ; save new highest 7cmpsmall: 8 A=B,B=A 9 A=D,D=A 10 A=B-A,F=NEG() 11 A=B-A,JMPF lastswap 12 A=B ;save new lowest 13lastswap: 14 A=D,D=A 15 A=IN1,B=A,DECNZ cmpbig 16 17 A=D,D=A,W=B 18 OUT1=W,W=A 19 OUT1=W 20 21 22; testing biggest 23; 24; A | B | D | 25; n | ^ | v | 26; ^-n | | | (n is bigger so ^-n is negative) 27; n | | | (B-=A, n was the highest, so now ^) 28; ^ | | | 29; v | | ^ | ... 30 31 32; testing lowest 33; 34; A | B | D | 35; v | n | ^ | 36; n-v | n | | 37; | | | 38; | | |