Skip to content

Backtracking algorithms solve problems by trying out solutions incrementally and undoing them if they lead to a dead end. It is a systematic method of trying out different solutions to a problem by incrementally building a solution and undoing it if it leads to an invalid state. It is commonly used in solving problems such as the n-queens problem.

Notifications You must be signed in to change notification settings

darian-catalin-cucer/backtracking-algorithms

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

2 Commits
 
 
 
 

Repository files navigation

Backtracking Algorithms Android App

An open-source Android application that implements various backtracking algorithms in Kotlin.

Features

  • User-friendly interface for inputting problem information
  • Implements algorithms for various problems such as the n-queens problem, Sudoku solver, and the traveling salesman problem
  • Option to visualize the steps of the algorithm in solving the problem
  • Can be used by students, computer scientists, and mathematicians alike

Getting Started

  1. Clone the repository: git clone https://github.com/cucerdariancatalin/BacktrackingAlgorithms.git
  2. Open the project in Android Studio
  3. Build and run the app on an emulator or physical device

Contributing

We welcome contributions to the project. If you want to contribute, please fork the repository and submit a pull request with your changes.

License

This project is licensed under the MIT License. See LICENSE for details.

About

Backtracking algorithms solve problems by trying out solutions incrementally and undoing them if they lead to a dead end. It is a systematic method of trying out different solutions to a problem by incrementally building a solution and undoing it if it leads to an invalid state. It is commonly used in solving problems such as the n-queens problem.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages