Skip to content

Backtracking is an algorithmic-technique for solving problems recursively by trying to build a solution incrementally and removing those solutions that fail to satisfy.

Notifications You must be signed in to change notification settings

Rahul-k25/Backtracking-Algorithm-Visualization

Repository files navigation

Backtracking-Algorithm-Visualization

Backtracking is an Algorithm-technique for solving problem recursively while trying to built solution incremently, one by one and removing thoes solution that fail to satisfy.

Knight's Tour and Rat in the Maze the based on Backtracking algorithm.

Knight's Tour

A knight's tour is a sequence of moves of a knight on a chessboard such that the knight visits every square exactly once.

Rat in the Maze

A rat starts from source and has to reach the destination. The rat can move only in two directions: forward and down.

Project Structure

  • Source files: main.py
  • Algorithm files: Knight_Tour.py, Rat_In_The_Maze
  • other files: ExtraWidgets.py, MainMenu.py, StartProcess.py

Prerequisite

Build

download or clone all the files
install all the prerequisite
run main.py

Contribution:

Feel free to add some code or add other backtracking algorithm

About

Backtracking is an algorithmic-technique for solving problems recursively by trying to build a solution incrementally and removing those solutions that fail to satisfy.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages