Hi folks.

Here's something I've been working on recently. What do you think?


Peter Popov ICQ : 15002700
Personal e-mail : pet### [at] vipbg
TAG      e-mail : pet### [at] tagpovrayorg

Post a reply to this message

Attachments:
Download 'maze-10x10.gif' (209 KB)

Preview of image 'maze-10x10.gif'

On Wed, 23 Apr 2003 13:34:39 +0300, Peter Popov <pet### [at] vipbg> wrote:


>Hi folks.
>
>Here's something I've been working on recently. What do you think?
>
It's very good Peter, but there are no entry or exit points. How are the paths
determined?

Regards
        Stephen

Post a reply to this message

About the maze or about the animation?

Peter Popov wrote:
> 
> Hi folks.
> 
> Here's something I've been working on recently. What do you think?
> 
> Peter Popov ICQ : 15002700
> Personal e-mail : pet### [at] vipbg
> TAG      e-mail : pet### [at] tagpovrayorg
> 
>   ------------------------------------------------------------------------
>                      Name: maze-10x10.gif
>    maze-10x10.gif    Type: GIF Image (image/gif)
>                  Encoding: base64

Post a reply to this message

On Wed, 23 Apr 2003 11:38:22 GMT, mca### [at] aolcom (S McAvoy) wrote:

>It's very good Peter, but there are no entry or exit points.

That's right, you're doomed to seek forever :)

Seriously, it's all a single maze so the entry and exit points can be
any two points in the maze or on the walls.

>How are the paths determined?

"Prim's Algorithm

"1. Maintain three sets of cells: IN, OUT, and FRONTIER.  Initially,
choose one cell at random and place it in IN.  Place all of the cell's
neighbors in FRONTIER and all remaining cells in OUT.

"2. While FRONTIER is not empty do the following:  Remove one cell at
random from FRONTIER and place it in IN.  If the cell has any
neighbors in OUT, remove them from OUT and place them in FRONTIER.
The cell is guaranteed to have at least one neighbor in IN (otherwise
it would not have been in FRONTIER); pick one such neighbor at random
and connect it to the new cell (ie knock out a wall)."


Peter Popov ICQ : 15002700
Personal e-mail : pet### [at] vipbg
TAG      e-mail : pet### [at] tagpovrayorg

Post a reply to this message

On Wed, 23 Apr 2003 15:45:09 +0300, Peter Popov <pet### [at] vipbg> wrote:

d?
>
>"Prim's Algorithm
>
Interesting I haven't read anything about it.

Regards
        Stephen

Post a reply to this message

> >How are the paths determined?
>
> "Prim's Algorithm


That's cool. I never thought of applying Prim's algorithm to maze creation.

 - Slime
[ http://www.slimeland.com/ ]

Post a reply to this message

Wow! I was just thinking making a Maze. some of my friends have won a
contest to build a real scale maze. They ask me to make a model of that
maze. I was just looking how could explain the rules. I'm planning to make
this model this summer.

Maybe I should send some pictures of the building process.





>
> >It's very good Peter, but there are no entry or exit points.
>
> That's right, you're doomed to seek forever :)
>
> Seriously, it's all a single maze so the entry and exit points can be
> any two points in the maze or on the walls.
>
> >How are the paths determined?
>
> "Prim's Algorithm
>
> "1. Maintain three sets of cells: IN, OUT, and FRONTIER.  Initially,
> choose one cell at random and place it in IN.  Place all of the cell's
> neighbors in FRONTIER and all remaining cells in OUT.
>
> "2. While FRONTIER is not empty do the following:  Remove one cell at
> random from FRONTIER and place it in IN.  If the cell has any
> neighbors in OUT, remove them from OUT and place them in FRONTIER.
> The cell is guaranteed to have at least one neighbor in IN (otherwise
> it would not have been in FRONTIER); pick one such neighbor at random
> and connect it to the new cell (ie knock out a wall)."
>
>
> Peter Popov ICQ : 15002700
> Personal e-mail : pet### [at] vipbg
> TAG      e-mail : pet### [at] tagpovrayorg

Post a reply to this message