Pete's QBASIC Site

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.

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

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

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.

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

I've seen people actually solve it!

Mac

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