A solution to N Queens problem using backtracking
-
Updated
Nov 19, 2016 - C
A solution to N Queens problem using backtracking
Implementing the backtracking algorithm to solve Sudoku games
A Longest Increasing Subsequence (LIS) reduction to solve a problem similar to the Building Bridges Problem. This implementation covers three different approaches: backtracking, greedy and dynamic programming.
A Simple C program to act as a example to better understant Backtracking
A project for 42. Find the smallest square that given tetronimos (tetris pieces) fit in to.
An implementation of my fillit project, using bitwise operators.
System programming & Algorithm ― Data structures and Algorithms
4th project of the global branch at 42 --> algorithm, parcing, backtracking for a Tetris filler program
Kruskal maze generator & Backtracking mazer solver
IDST232C Codes
🌈The purpose is to create the smallest possible "square" with a given list of tetriminos.
👾This is the story of a piece of Tetris, one little square and a dev walk into a bar...
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."