Maze algorithms

Mentat · Post by **Mentat** » Mon Aug 13, 2007 7:21 pm

How would anybody make a maze making algorithm? I have the cpu add a point as long as there isn't a point in the immediate and immediate to immediate spot. For some reason, it's slow and doesn't work well (its TI-BASIC, which has a good pxl-checker but slow pseter).

This forum is more for sharing ideas, not as just a question.

MystikShadows · Post by **MystikShadows** » Mon Aug 13, 2007 8:33 pm

I typically use an array for that. A 2 dimensional array that is.

Stoves · Post by **Stoves** » Mon Aug 13, 2007 9:07 pm

Interesting maze algorithm discussion and reference page: http://www.astrolog.org/labyrnth/algrithm.htm

Anonymous · Post by **Anonymous** » Tue Aug 14, 2007 12:07 am

Hi,

I would suggest making the maze in the array and then display the maze after it has been made. Accessing memory tends to be faster than using a function like pset because pset does some extra stuff you don't always need.

Mac · Post by **Mac** » Tue Aug 14, 2007 7:24 pm

Try my Maze from Hell
http://www.network54.com/Forum/190883/m ... 1021149818

I've seen people actually solve it!

Mac

Mentat · Post by **Mentat** » Tue Aug 14, 2007 7:32 pm

Here's a misc. link:
http://www.mazewars.com:8190/in/index.jsp

Pete's QBASIC Site

Maze algorithms

How do you create a maze?

Maze algorithms

I voted array