Posts Tagged ‘ java

Pathfinding with PathFinder

PathFinder is a Java-application for visualizing path finding algorithms. It was written by Dirk Reske an me while a course at our University.

The goal was to implement a hugh amout of path-finding algorithms and compare them against each other. Some of the algorithms which we build in are:

  • A*
  • Depth first
  • Breadth first
  • Hill climbing
  • Beam search
  • British museum
  • Branch and bound
  • Dijkstra
  • Depth limited
  • Great deluge

Dirk already wrote a detailed article about PathFinder:  http://www.dirkreske.de/pathfinder/