This is an archived, read-only copy of the United-TI subforum , including posts and topic from May 2003 to April 2012. If you would like to discuss any of the topics in this forum, you can visit Cemetech's
Your Projects subforum. Some of these topics may also be directly-linked to active Cemetech topics. If you are a Cemetech member with a linked United-TI account, you can link United-TI topics here with your current Cemetech topics.
Project Ideas/Start New Projects =>
Your Projects
| Author |
Message |
|
LolBbq
Advanced Member
Joined: 08 Apr 2006
Posts: 351
|
 Posted: 15 Feb 2007 03:04:33 pm Post subject: |
|
|
If you've played any pokemon game, you would remember that those mountain/underground cave mazes that involved climbing ladders and falling down certain holes to traverse each dungeon level were pretty hard. I want to know if there's a way to modify a depth-first search algorithm to allow the generation of good mazes with the following criteria:
- Same randomization on any single plane (NSWE);
- movement between different planes in one direction (Ladders and holes are one way paths);
- any ladders or holes cannot lead to a dead end which inadvertently prevents the player from completing the maze;
- and the solution path must pass through all specified planes.
|
|
| Back to top |
|
|
|
Register to Join the Conversation
Have your own thoughts to add to this or any other topic? Want to ask a question, offer a suggestion, share your own programs and projects, upload a file to the file archives, get help with calculator and computer programming, or simply chat with like-minded coders and tech and calculator enthusiasts via the site-wide AJAX SAX widget? Registration for a free Cemetech account only takes a minute.
»
Go to Registration page
