Re: p89lpc922

On Tue, 20 Dec 2005 10:19:21 -0700, Jim Thompson wrote:
> On 20 Dec 2005 09:14:41 -0800, "Anshat" <anshat@xxxxxxxxx> wrote:
>
>>Hello Everyone
>>iam new this grp sole reason to join this group is that i am finding
>>myself unable to find a suitable algorithm for the mouse . I have
>>P89LPC922 microcontroller i am contantly searching net for an algorithm
>>
>>to solve maze but it only gives me a hint towards Bellmans algorithm.
>>We have sat on paper but not getting a foolproof algorithm.
>>Can anyone help me
>>anshat Singhal
>>MNIT Jaipur
>>India
>
> Touch the wall on the right, or the left, doesn't matter. Go forward,
> NEVER stop touching the wall.

You have, of course, seen the mazes where this doesn't work? I've seen an
example of a maze that doesn't have a continuous wall all the way to the
goal - you'll just go in circles, because it's a whole nother maze inside
a maze.

But, while looking for something to corroborate this, I accidentaly
searched google, and imagine my surprise:
http://www.google.com/search?q=maze+solving

which somehow seems apropos to the OP's question.

Cheers!
Rich

.

Relevant Pages

  • Re: Mazes
    ... The exact characteristics of the maze can be ... You can increase the connectivity by later destroying some of the walls. ... You can put exits anywhere, as long as they align with rooms (i.e. have ... You could try a more free-from version of this algorithm -- that is, ...
    (rec.games.roguelike.development)
  • Re: Solving mazes!!!
    ... >> algorithm solves any maze. ... If you start in the centre square, you will _never_ find out, ... > border and are looking for a border exit, ...
    (comp.lang.c)
  • Re: RuntimeError maximum recursion depth exceeded
    ... The algorithm is "deep first" walk in a maze, ... for big dimentions the algorithm needs to be re-written w/o recursion. ...
    (comp.lang.python)
  • Re: Solving mazes!!!
    ... >> The classical algorithm of solving mazes is keep looking left or keep ... >> elseif then go forward ... algorithm solves any maze. ...
    (comp.lang.c)
  • Re: Artefactless fov
    ... square is seen or not now hinges on whether that square is a wall. ... If 'a' is a wall, it is visible, but if it isn't a wall, then it isn't ... which Raycasting with Bresenham's Algorithm FoV approximates. ...
    (rec.games.roguelike.development)
Quantcast