Solving mazes with spring kinematics


Previously, previously, previously.

Tags: , , ,

4 Responses:

  1. Merc says:

    Very cool, but probably impractical.  By the time you have a starting shape, you have all the lengths, so A* would work.

    It does seem a lot like an example of "how nature solves problem X", when the CS way is iterative and not-beautiful, but still optimal for a digital computer.

  2. xbat says:

    Imagining a dimensional traveller who walks through the maze as if it were a straight line, shearing around corners in the 3d view.

  3. Brian Enigma says:

    I imagine this would make a fun DaliMaze screensaver modules.

  • Previously