On Tuesday 27 February 2001 16:28, you wrote:
> I was thinking about an algorithm similar to the maze-pathfinder...
> Percolation... Recursive.... What about that, oh great programming guru
> Maarten?
That's possible as well, to use a recursive flooding algorithm. But I think
it's messier to implement, especially in assembly. You have to remember the
points you already visited, otherwise you could end up in an infinite loop.
And in assembly recursion isn't as easy as in a higher level programming
language, you have to stack the local variables manually. And make sure it
all fits on the stack.
> Duh - ripping an Java algorithm of the internet and presenting that
> on a silver platter is not the essence of a 'programming guru'.
> That's more like 'script kiddie'...
>
> Eric (*real* programming guru)
>
> <huge> ;-) </huge>
<dutch>Ik moet toch even happen...</dutch>
(inaccurate translation: I can't resist to react)
I wrote that I took it from our standard algorithms library. Guess who put
the algorithm in there... Anyway, it is an existing standard algorithm and
real programming gurus know they shouldn't re-invent the wheel. ;)
Bye,
Maarten
--
For info, see http://www.stack.nl/~wynke/MSX/listinfo.html
