The project includes advanced algorithms for optimal move strategies in games like Sudoku and Tic-Tac-Toe, ensuring challenging gameplay and efficient problem-solving.
-
Updated
Jun 12, 2024 - C
The project includes advanced algorithms for optimal move strategies in games like Sudoku and Tic-Tac-Toe, ensuring challenging gameplay and efficient problem-solving.
Ciencias de la computación impartidas en la Unidad Profesional Interdisciplinaria de Ingeniería Campus Tlaxcala (Linux)
2D video game (same in Pokemon Mystery Dungeon)
📈 Welcome to the Design and Analysis of Algorithms Repository! 📚✨ Immerse yourself in a meticulously curated knowledge pool on algorithmic design and analysis. 🌐💡 Explore the intricacies of crafting efficient algorithms and navigating problem-solving strategies. 🚀🔍 Master the art of algorithmic exploration in this dynamic space! 👨💻🧮
Using the backtracking method, place on a NxN chess board on every line, a queen, so that they can't take out eachother
Using the backtracking method, the code will read form a file a sequins of random natural numbers and creating all the combination in which they are in order.
A Sudoku puzzle generator, checker and solver written in C using backtracking algorithm
A "playground" of backtracking programs
The Maze Solver program uses a backtracking algorithm to determine if a mouse can escape from a maze. It systematically tries all routes through the maze and retraces back its path when it reaches a dead end. If all routes are exhausted, the program determines that the mouse is trapped.
Fillit or Fill-it is a project allowing you to discover the search for an optimal solution among a very large number of possibilities, within a reasonable time. Its a Space Optimization Algorithm: Program that solves the smallest square that can accommodate them tetrimino pieces using recursive backtracking.
This is an implementation of the Sub Set Sum Backtracking algorithm in C. The algorithm is used to find a subset of a given set of numbers that adds up to a given sum. The algorithm is implemented using backtracking.
This is a promising implementation of the n-Queens problem in C. It uses a recursive backtracking algorithm to find all solutions to the n-Queens problem. It is a promising implementation because it uses a heuristic to prune the search tree. The heuristic is to only place a queen in a column if it is not in check with any other queens.
A multi-threaded sudoku solver using the backtrack algorithm.
Algorithm capable of solving the sky-scrapper game using backtracking.
Repositório destinado a atividades e projetos da disciplina Análise e Projeto de Algoritmos
Resolver of 9x9 sudoku
Add a description, image, and links to the backtracking-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the backtracking-algorithm topic, visit your repo's landing page and select "manage topics."