Greedy and backtracking approaches to optimal assignment scheduling.
-
Updated
Mar 11, 2023 - C++
Greedy and backtracking approaches to optimal assignment scheduling.
Every leetcode solution solved by me.
A simple solver for a puzzle I bought on holiday. See `solution.txt` to get an overview of how the puzzle works
Backtracking is a problem-solving method that builds solutions incrementally and abandons paths that fail constraints. It uses recursion to explore all possibilities, commonly applied in puzzles and optimization problems.
Recursive backtracker maze generator and visualizer built with C++17 and olcPixelGameEngine.
Brute force solver fo the puzzle described in https://en.wikipedia.org/wiki/TetraVex
A few codes for practicing problem solving and competitive coding. XD
计算机算法设计与分析
A Sudoku Solver implemented using Backtracking Algorithm in cpp language
Solvaxo is a very fast and efficient sudoku solver. It's based on backtracking algorithm. Backtracking is an algorithmic-technique for solving problems recursively by trying to build a solution incrementally, one piece at a time, removing those solutions that fail to satisfy the constraints of the problem at any point of time.
Finds a solution for a given partially complete quasigroup (latin square). This code was written as a part of CSE318: Artificial Intelligence Sessional course work.
This is practice repository of DSA
This repo contains my DSA implementation, practice problems and some Assignments.
Implementations of popular optimization & search algorithms
Data Structures and Algorithms
Data structure and Algorithm | All Standard problem solved
iterative backtracking maze generator
Contains programs done during data structures online course.
Add a description, image, and links to the backtracking topic page so that developers can more easily learn about it.
To associate your repository with the backtracking topic, visit your repo's landing page and select "manage topics."