hugi compo #29- random mazes - how reduce size of this
in [ASM]
|
From: Esra Sdrawkcab on 3 Oct 2009 03:37 On Sat, 03 Oct 2009 08:23:30 +0100, io_x <a(a)b.c.invalid> wrote: > > "Esra Sdrawkcab" <admin(a)127.0.0.1> ha scritto nel messaggio > news:op.u06rdzmrhswpfo(a)dell3100... >> On Fri, 02 Oct 2009 10:36:20 +0100, io_x <a(a)b.c.invalid> wrote: >> You don't set the initial cell using the random number generator. > > why have i to set the initial cell *random*? > i choose the first one of the maze > To match the example competition results! -- Nuns! Reverse!
From: io_x on 3 Oct 2009 04:49 "Esra Sdrawkcab" <admin(a)127.0.0.1> ha scritto nel messaggio news:op.u07rhes0hswpfo(a)dell3100... > On Sat, 03 Oct 2009 08:23:30 +0100, io_x <a(a)b.c.invalid> wrote: > >> >> "Esra Sdrawkcab" <admin(a)127.0.0.1> ha scritto nel messaggio >> news:op.u06rdzmrhswpfo(a)dell3100... >>> On Fri, 02 Oct 2009 10:36:20 +0100, io_x <a(a)b.c.invalid> wrote: >>> You don't set the initial cell using the random number generator. >> >> why have i to set the initial cell *random*? >> i choose the first one of the maze >> > To match the example competition results! they want pseudo random mazes: i give the pseudo random mazes (that seems it is ok for the test program); there is in no place in the rules text that the initial cell for begin the algo should be random too > -- > Nuns! Reverse!
From: io_x on 3 Oct 2009 05:02 "io_x" <a(a)b.c.invalid> ha scritto nel messaggio news:4ac5c7f6$0$1106$4fafbaef(a)reader4.news.tin.it... > http://www.frontiernet.net/~fys/hugi/hcompo.htm > ; ******************************************* > ; *** Fa il labirinto > ; ******************************************* > ; parte dalla casella puntata da si > inc si ; punta all'interno della casella, dove c'e' > 'N' > mov di, sp ; salva lo stack per l'uscita > .9: mov word[si], " " ; " " significa visitata > .9a: mov ax, [seed] > mul word[val] ; rand() > inc ax > mov [seed], ax > add al, ah ; valore casuale in al > and ax, 03h ; al=0[sotto],1[alto],2[sinistra],3[destra] > mov cx, 4 ; le caselle confinanti sono 4 > .9b: mov bx, ax > add bx, ax > mov bp, [conv+bx] ; in bp l'offset > cmp byte[si+bp], 'N' ; si+bp punta alla casella confinante > je .a ; vede se tale casella � visitata, se si' va in .a ^^^^ ; vede se tale casella � visitata, *se non visitata* va in .a > inc ax > and al, 3 > loop .9b ; va alla prossima casella > ; ** caso le caselle sono tutte visitate > cmp di, sp > jbe .z ; se lo stack e' vuoto esci[ e'in casella iniziale] > pop ax ; altrimenti prende la casella precedente > add si, ax ; ax=-162,+3,+162,-3 passa alla casella precedente > jmp short .9a > .a: ; ** caso vi � una casella non visitata > mov bx, [muro+bx] ; si+bx punta al muro (oppure a un char precedente) > mov word[si+bx], " " ; leva il muro di divisione [ed eventualemente una > N] > ; che verra' in ogni caso levata in .9 > add si, bp > neg bp ; neg bp poiche' trova la casella precedente > push bp > jmp short .9 ; quando fa il pop e ritrova la strada > .z: ; usa la casella iniziale in si e la ritorna
From: Esra Sdrawkcab on 3 Oct 2009 19:46 On Sat, 03 Oct 2009 08:23:30 +0100, io_x <a(a)b.c.invalid> wrote: > > "Esra Sdrawkcab" <admin(a)127.0.0.1> ha scritto nel messaggio > news:op.u06rdzmrhswpfo(a)dell3100... >> On Fri, 02 Oct 2009 10:36:20 +0100, io_x <a(a)b.c.invalid> wrote: >> You don't set the initial cell using the random number generator. > > why have i to set the initial cell *random*? > i choose the first one of the maze It's a fine maze generator, but it's in the rules; the generated maze has to match exactly that made by Example.com -- Nuns! Reverse!
From: Esra Sdrawkcab on 3 Oct 2009 19:51
On Sat, 03 Oct 2009 08:13:16 +0100, io_x <a(a)b.c.invalid> wrote: > > "Esra Sdrawkcab" <admin(a)127.0.0.1> ha scritto nel messaggio > news:op.u06rdzmrhswpfo(a)dell3100... >> On Fri, 02 Oct 2009 10:36:20 +0100, io_x <a(a)b.c.invalid> wrote: >> >>> http://www.frontiernet.net/~fys/hugi/hcompo.htm >>> This for other information >> >>> >>> This is my 182 bytes entry, but there are people say enought 135bytes >>> and some other 96bytes >>> >> No, the current leader is 134 bytes. 96 seems *very* ambitious! >> >>> How i can reduce its size? >>> Than i not understand why for maze to much big the program not give >>> the correct result. >> >> You don't set the initial cell using the random number generator. > > why i have to set the initial cell? > >> Thanks for the code; I'm going to see what can be shortened, but it >> needs to >> get bigger first to add the RNG to locate the initial cell. > > yes all you is allow to use it in competition too > No I wouldn't enter anything based on your code; it would hardly be mine, and as I said my previous attempts were too large, so I won't be submitting anything. I was going to see if I could suggest some shortening of your code, and if *you* want you could enter it under your name, but I'm not looking to take any credit. -- Nuns! Reverse! |