4th project of the global branch at 42 --> algorithm, parcing, backtracking for a Tetris filler program

Maze generator/solver (backtracking implementation)

Logic puzzle solver implementing constraint satisfaction algorithms - 42 School algorithmic thinking project with backtracking and optimization

A fast sudoku solver implemented in C using a backtracking algorithm.

Implementation of an algorithm that has the idea of backtracking for the context of a maze

This repo contains all the programs of Design and Analysis of Algorithm (DAA) Lab [SEMESTER 4]

Trabalhos Práticos da disciplina de CCF 330 - Projeto e Análise de Algoritmos

Réalisation d'un projet permettant d'agencer des Tetriminos entre eux et de déterminer le plus petit carré possible pouvant les accueillir.

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.

An array is squareful if the sum of every pair of adjacent elements is a perfect square. Given an integer array nums, return the number of permutations of nums that are squareful. Two permutations perm1 and perm2 are different if there is some index i such that perm1[i] != perm2[i].

A Simple C program to act as a example to better understant Backtracking

Sudoku solver in plain C

Programming labs on recursion, backtracking, combinatorics, greedy algorithms, dynamic programming, and graph algorithms.

An introduction to different algorithmic approach

N Queen Problem

This is my own implementation of a Regular Expression engine in C based off of this video by Low Byte Productions

Program that fit given tetris pieces into the smallest square possible.

A "playground" of backtracking programs

This is a simple yet powerful Sudoku Solver implemented in C using backtracking. The program takes an incomplete 9x9 Sudoku puzzle as input (with 0 representing blank cells) and fills it with a valid solution if one exists.

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.