Stefan Bruins
LinkedIn icon Google+ icon Facebook icon Twitter icon

Search Algorithm Visualizations project

About the project

Date of project: -

In this project I implemented visualizations for a number of search algorithms that show how the algorithms work. I created this for first year college students following an introductory course on artificial intelligence at the VU. It is used as extra study material to help teach them how these search algorithms work.

For each of the search algorithms I made three ways of visualizing them: a tree, a maze and the search space of an eightpuzzle being displayed as a tree.

Included search algorithms: breadth first search, depth first search, iterative deepening, hill climbing, best first search, beam search, algoritme A, algoritme A*, MiniMax.

Project result

The demo shows the visualizations of the algorithms and a textual explanation of each algorithm and its properties.

Project screenshots

  • Screenshot of the 'Search Algorithm Visualizations' project showing the breadth first search page. An example screenshot of the tree visualization showing the breadth-first-search algorithm.
  • Screenshot of the 'Search Algorithm Visualizations' project showing a maze visualization of some algorithm. An example screenshot of the maze visualization.
  • Screenshot of the 'Search Algorithm Visualizations' project showing an eight puzzle visualization of some algorithm. Example screenshot of how the algorithm solves an eight puzzle.
  • Screenshot of the 'Search Algorithm Visualizations' project showing the algorithm A page. Example screenshot of algorithm A being visualized by a tree.