";
//echo displaymap($map, 0, true);
//Demo nothing.
$basicmapcode = '6x3.c0.r0.w9.t0.:0s.4f.0s.4f.0s.4f.';
$basicmap = displaymap(GenerateMapByCode($basicmapcode), 1, 'example');
//Map Demoing the checkpoints
$cpcode = "6x3.c5.r0.w9.t0.:0s.0a.2b.0f.0s.1e.2f.0s.0d.2c.0f.";
$cpmap = displaymap(GenerateMapByCode($cpcode), 2, 'example');
//Map Demoing the teleports
$tpcode = "6x3.c0.r0.w5.t4.:0s.0n.2t.0f.0s.4f.0s.0u.2m.0f.";
$tpmap = displaymap(GenerateMapByCode($tpcode), 3, 'example');
?>
Tutorial
The object of the game is to make the longest maze.
The "Snake" (name pending) must go to all the checkpoints.
It starts from the red arrows:
and goes to the blue arrows:
Build a maze by clicking to place blocks. You can remove a block by clicking it again.
It must be able to make it through your maze, so no walling completely!
Try it:
Checkpoints:
The path must reach all these (if they exist) before going to finish. Try it:
Tip: - Try to combine odd-letters with each other;
I.E. If A, B, C exist, try to make a box around A and C, then maze the entrance to the box.
This way, the path enters the box for A, leaves for B, returns for C, and leaves for the exit.
This would make the path go through your maze 4 times!
Teleports:
Teleport tiles are traps. When the path goes across the "IN" tile, it gets thrown to the "OUT" tile.
The path will not avoid teleports. Check this example out:
Implementing a teleport into your maze can have a big impact.
That should be enough information to get you started.
Now go try it out!