This program helps users to solve the endless halls maze. The idea is to feed it information about your own maze as you explore it, untill it has enough information to draw your unique map from all the possible combinations. It comes already with a solved maze so you can see how it works.
Once the maze is solved you can click on any two rooms to calculate the shortest path between them.
As you explore, using either an addon or drawing on map, you will discover paths between the different rooms. Then you need to add that information to the textbox on the left and press the "Process Data" button. The data is inserted using a simple text format:
# represents a rune room
$ represents an orb room
R, G, B, Y, P represent the colors red, green, blue, yellow, purple
&T represents the teleport trap room
Example: You start in the yellow orb room. You move south, south, south, south, west, south, west, west and you arrive at the green rune room. You would input $YSSSSWSWW#G. Whenever you pass a special room you need to identify it, even if you've done it before.
This information alone is not enough for the program to calculate anything. The program would just show all the squares with a check mark. These represent all the possible rooms that may be be the initial room you gave it (in this case the yellow orb room). Since there is very little information yet, it may be any room.
As you add more information, the program will rule out rooms as the possible starting position.
Once you have enough information, the program is able to figure out the position of the rooms you have already mapped. At this point you will know exactlly what rooms you already visited and what rooms are missing, and their exact location.
Knowing all the missing rooms positions makes it easiear to find them and get the complete map.
You can click on any 2 rooms on the map to display the shortest path to travel between them.
If you click the process data button and just see an empty white grid, it means some of the information is wrong.
You can add any paths in any order to the program, as long as you're 100% sure they are valid. Explore the map in small sections and process them separatelly, don't try to do big maps all at once. Any error passed to the program can mess up the whole map. Check this image for an example of the explorations that resulted in the example map (areas in gray background are not valid because I crossed the trap room at some point).
There is a trap room that teleports you to another random room on the map, making things harder when you start. The only way to be 100% sure you were not teleported during a path is going back the same way you came and make sure the initial room is there.
What I suggest to start is:
Run randomly untill you find a special room
Start mapping from that room and and run randomly untill you reach another special room
Go back to the first special room to make sure the path is valid
Run randomly in a different direction untill you reach another special room
Repeat the process to expand the map
If you run through the teleport room or the maps starts getting too messy, just copy only the pieces of information you know for sure are correct and start mapping another section starting from any other special room, untill you get a full map.