User talk:Topknot

Hello, welcome to Wikipedia. Here are some useful links in case you haven't already found them:

If you have any questions, see the help pages, add a question to the village pump or ask me on my talk page. I hope you enjoy editing here and being a Wikipedian!

Tip: you can sign your name with ~~~~

snoyes 18:54, 9 Dec 2003 (UTC)

Micromouse and A*

hi,

this is in response to your questions on: User Talk:BAxelrod

I think i was mistaken, because it looks like the Lee-Moore maze flooding is what i was refering to. This is not exactly my area of expertise, so if you know better, you can certainly change the page. However, i think that the Lee-Moore algorithm can be considered a simplified version of A*. (an examination of the external links on the A* page might make this clear). This simplified version has a very bad heuristic and a uniform path cost. It is not inconceivable that a mouse use A* especially when the locations of the start and goal states are known. This would allow a reasonable heuristic to be formed and would decrease search time. But in these competitions, search time is usually unlimited or very long so the overhead is probably not worth it. If you feel that the A* remark should be replaced with Lee-Moore, then please do so.

P.S. I am going to copy this discussion (your comments on my page, and my comments on your page) to the Talk page of Micromouse. Lets continue it there: Talk:Micromouse

--BAxelrod 20:48, 24 Nov 2004 (UTC)