A valid description will come later, but in short, I'm computing the minimum spanning tree (in blue) and a solution of the traveling salesman problem (in red).

You can hide the blue tree with btn_4 (<c> on a keyboard).
You can hide the red path with btn_5 (<v> on a keyboard).

P#46228 2017-11-13 10:00 ( Edited 2017-11-13 15:00)

  0 comments  

This cartridge is just a solution of a problem from an algorithm course. It's not made to be reused!
But do what you want with it ;-)

How to use:

• first state is step by step generation, press btn_5 (<x> on keyboard) for next step or btn_4 (<z>) for automatic generation
• second state is auto generation, press btn_5 to speed it up (+20%), or btn_4 for generating all at once
• when the maze is generated (green pixel at bottom right corner), press btn_5 for show/hide path to the exit, move with the arrows keys or press btn_4 to restart from the begining

maze

P#44484 2017-09-23 13:44 ( Edited 2017-09-24 06:32)

  2 comments