Prev: FILE_FLAG_POSIX_SEMANTICS question
Next: x86-based VM: code/data sharing and security...
From: io_x on 17 Oct 2009 13:13

"io_x" <a(a)b.c.invalid> ha scritto nel messaggio
news:4ad9f8c7$0$1095$4fafbaef(a)reader3.news.tin.it...
> "Esra Sdrawkcab" <admin(a)127.0.0.1> ha scritto nel messaggio
>> thanks. I'll take a look. can I email you privately with the ideas I had? to
>> save the hardcore competition players from worrying that I'm giving too much
>> away?
>
> no; i not agree on what Sir Espineter says

it is all right all remain one secret until the end of the competition


From: io_x on 17 Oct 2009 13:17

"io_x" <a(a)b.c.invalid> ha scritto nel messaggio
news:4ad9f988$0$1107$4fafbaef(a)reader3.news.tin.it...
>
> "io_x" <a(a)b.c.invalid> ha scritto nel messaggio
> news:4ad9f8c7$0$1095$4fafbaef(a)reader3.news.tin.it...
>> "Esra Sdrawkcab" <admin(a)127.0.0.1> ha scritto nel messaggio
>>> thanks. I'll take a look. can I email you privately with the ideas I had?
>>> to save the hardcore competition players from worrying that I'm giving too
>>> much away?
>>
>> no; i not agree on what Sir Espineter says
>
> it is all right all remain one secret until the end of the competition

it is all right each one of us has secrets until the end of the competition.

it is all right too, all goes to public so anyone can see.


From: Esra Sdrawkcab on 17 Oct 2009 16:27
On Sat, 17 Oct 2009 18:17:28 +0100, io_x <a(a)b.c.invalid> wrote:

>
> "io_x" <a(a)b.c.invalid> ha scritto nel messaggio
> news:4ad9f988$0$1107$4fafbaef(a)reader3.news.tin.it...
>>
>> "io_x" <a(a)b.c.invalid> ha scritto nel messaggio
>> news:4ad9f8c7$0$1095$4fafbaef(a)reader3.news.tin.it...
>>> "Esra Sdrawkcab" <admin(a)127.0.0.1> ha scritto nel messaggio
>>>> thanks. I'll take a look. can I email you privately with the ideas I
>>>> had?
>>>> to save the hardcore competition players from worrying that I'm
>>>> giving too
>>>> much away?
>>>
>>> no; i not agree on what Sir Espineter says
>>
>> it is all right all remain one secret until the end of the competition
>
> it is all right each one of us has secrets until the end of the
> competition.
>
I don't have a problem sharing.

> it is all right too, all goes to public so anyone can see.
>
I'm a bit confused as to your position on this; anyway for what it's
worth, my idea was to have a minimaze;
+-+-+...cr
|N|N|...cr
+-+-+...cr
then create path, this makes finding the wall and floor easier (cell is at
2x, wall/flr is at x)
(x=-1,+1,-row,+row), then print using

mov cx,(2*rows+1)*(cols+1)/2
expandmaze:
lodsw ; "+-" or "wall blank"
stosw
cmp al,cr ; expand cr to crlf
jne addone
mov al,lf
addone:
stosb ; otherwise duplicate floor or blank cell
loop expandmaze


but it didn't give enough saving in the find flr/wall

--
Nuns! Reverse!
From: io_x on 18 Oct 2009 03:48
"Esra Sdrawkcab" <admin(a)127.0.0.1> ha scritto nel messaggio
news:op.u1yof5r5hswpfo(a)dell3100...
> On Sat, 17 Oct 2009 18:17:28 +0100, io_x <a(a)b.c.invalid> wrote:
>> "io_x" <a(a)b.c.invalid> ha scritto nel messaggio
>> news:4ad9f988$0$1107$4fafbaef(a)reader3.news.tin.it...
>>>
>>> "io_x" <a(a)b.c.invalid> ha scritto nel messaggio
>>> news:4ad9f8c7$0$1095$4fafbaef(a)reader3.news.tin.it...
>>>> "Esra Sdrawkcab" <admin(a)127.0.0.1> ha scritto nel messaggio
>>>>> thanks. I'll take a look. can I email you privately with the ideas I had?
>>>>> to save the hardcore competition players from worrying that I'm giving
>>>>> too
>>>>> much away?
>>>>
>>>> no; i not agree on what Sir Espineter says
>>>
>>> it is all right all remain one secret until the end of the competition
>>
>> it is all right each one of us has secrets until the end of the competition.
>>
> I don't have a problem sharing.
>
>> it is all right too, all goes to public so anyone can see.
>>
> I'm a bit confused as to your position on this; anyway for what it's worth,
> my idea was to have a minimaze;
> +-+-+...cr
> |N|N|...cr
> +-+-+...cr

this above way [maze like cell of 6 chars] seems too long; i now try:
a maze is one array where each cell is just one char

> then create path, this makes finding the wall and floor easier (cell is at
> 2x, wall/flr is at x)
> (x=-1,+1,-row,+row), then print using

yes

> mov cx,(2*rows+1)*(cols+1)/2
> expandmaze:
> lodsw ; "+-" or "wall blank"
> stosw
> cmp al,cr ; expand cr to crlf
> jne addone
> mov al,lf
> addone:
> stosb ; otherwise duplicate floor or blank cell
> loop expandmaze

don't know

>
> but it didn't give enough saving in the find flr/wall
>
> --
> Nuns! Reverse!


From: Esra Sdrawkcab on 18 Oct 2009 06:17
On Sun, 18 Oct 2009 08:48:37 +0100, io_x <a(a)b.c.invalid> wrote:

> "Esra Sdrawkcab" <admin(a)127.0.0.1> ha scritto nel messaggio
> news:op.u1yof5r5hswpfo(a)dell3100...
>> On Sat, 17 Oct 2009 18:17:28 +0100, io_x <a(a)b.c.invalid> wrote:
>>> "io_x" <a(a)b.c.invalid> ha scritto nel messaggio
>>> news:4ad9f988$0$1107$4fafbaef(a)reader3.news.tin.it...
>>>>
>>>> "io_x" <a(a)b.c.invalid> ha scritto nel messaggio
>>>> news:4ad9f8c7$0$1095$4fafbaef(a)reader3.news.tin.it...
>>>>> "Esra Sdrawkcab" <admin(a)127.0.0.1> ha scritto nel messaggio
>>>>>> thanks. I'll take a look. can I email you privately with the ideas
>>>>>> I had?
>>>>>> to save the hardcore competition players from worrying that I'm
>>>>>> giving
>>>>>> too
>>>>>> much away?
>>>>>
>>>>> no; i not agree on what Sir Espineter says
>>>>
>>>> it is all right all remain one secret until the end of the competition
>>>
>>> it is all right each one of us has secrets until the end of the
>>> competition.
>>>
>> I don't have a problem sharing.
>>
>>> it is all right too, all goes to public so anyone can see.
>>>
>> I'm a bit confused as to your position on this; anyway for what it's
>> worth,
>> my idea was to have a minimaze;
>> +-+-+...cr
>> |N|N|...cr
>> +-+-+...cr
>
> this above way [maze like cell of 6 chars] seems too long; i now try:
> a maze is one array where each cell is just one char

I tried that but gave up when I found I was having too many bit
operations; such as:
lodsb
mov dl,al ; save
or al,3 ; test for connected
jnz
....
shr dl,1 ; for floor etc

still, good luck!

>
>> then create path, this makes finding the wall and floor easier (cell is
>> at
>> 2x, wall/flr is at x)
>> (x=-1,+1,-row,+row), then print using
>
> yes
>
>> mov cx,(2*rows+1)*(cols+1)/2
>> expandmaze:
>> lodsw ; "+-" or "wall blank"
>> stosw
>> cmp al,cr ; expand cr to crlf
>> jne addone
>> mov al,lf
>> addone:
>> stosb ; otherwise duplicate floor or blank cell
>> loop expandmaze
>
> don't know
>
>>
>> but it didn't give enough saving in the find flr/wall
>>
>> --
>> Nuns! Reverse!
>
>


--
Nuns! Reverse!
First  |  Prev  |  Next  |  Last
Pages: 1 2 3 4 5
Prev: FILE_FLAG_POSIX_SEMANTICS question
Next: x86-based VM: code/data sharing and security...