Ciencias de la computación impartidas en la Unidad Profesional Interdisciplinaria de Ingeniería Campus Tlaxcala (Linux)

Win32 developed GUI to solve sudoku puzzles in real-time. Visualize the puzzle being solved by a depth-first-search backtracking algorithm.

Kruskal maze generator & Backtracking mazer solver

Design and Analysis of Algorithms

Solving the popular NP problem, The Subset Sum Problem, with an Amortized O(n) algorithm based on Recursive Backtracking. The Algorithm stood second fastest in the organized Intra-University competition.

A simple C program that solves Sudoku puzzles using the backtracking technique.

Solving subset sum problem by backtracking and Approximation approach

Sudoku game built using C programming language and backtracking algorithm

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.

A Sudoku puzzle generator, checker and solver written in C using backtracking algorithm

📈 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! 👨‍💻🧮

This lab focuses on implementing and analyzing various algorithmic techniques, providing hands-on experience in solving computational problems efficiently using different design strategies.

Algorithm capable of solving the sky-scrapper game using backtracking.

Domino Project (Language c)

Sudoko game with backtracking algo

a program to fill the smallest square with given tetrominos (using Knuth's Algorithm X)

Put Tetris in the Minimum Squard ◻️

Implementação de quatro algoritmos (Grafo, Backtracking, Branch and Bound, Paradigma Guloso)

The project includes advanced algorithms for optimal move strategies in games like Sudoku and Tic-Tac-Toe, ensuring challenging gameplay and efficient problem-solving.

Implementation of different algorithms and problems