The Search Tree Simulator is an interactive web-based tool designed to help users visualize and understand various tree search algorithms step by step. The project simulates popular search algorithms like Breadth-First Search, Depth-First Search, A*, and more, allowing users to observe the process of traversing through a tree-like structure.
You can try out the Search Tree Simulator live on GitHub Pages here:
- Visualize the execution of different search algorithms.
- Step-by-step traversal of nodes.
- Supports multiple algorithms including Breadth-First Search, Uniform-Cost Search, Greedy Best-First Search, and A*.
- Customizable strategy template for users to experiment and create their own algorithms.
- Use the context menu to easily add nodes and connections to the tree.
- Breadth-first Search (BFS)
- Uniform-Cost Search
- Depth-First Search (DFS)
- Depth-First Search (Avoid Loops)
- Iterative Deepening Search
- Greedy Best-First Search
- A* Search
- Custom Strategy (blank template to allow users to experiment)
- Open the simulator in your browser.
- Select an algorithm from the list.
- Press "Start" to begin the simulation.
- Watch the nodes being explored in real-time as the algorithm runs step-by-step.
- Right-click on the canvas to open the context menu and add new nodes and connections.
- Modify and experiment with the custom strategy to create your own tree search logic.
To run this project locally, follow these steps:
-
Clone the repository:
git clone https://github.com/Mohelm97/search-tree-simulator.git
-
Install the dependencies:
cd search-tree-simulator npm install -
Start the development server:
npm run dev
-
Open your browser and go to
http://localhost:8080.
This project is licensed under the MIT License.
Mohammed N. Almadhoun
Created during an AI course with Prof. Mohammed Alhanjouri at the Islamic University of Gaza (IUG).
Contact: [email protected]