A solution to N Queens problem using backtracking
-
Updated
Nov 19, 2016 - C
A solution to N Queens problem using backtracking
A "playground" of backtracking programs
A project for 42. Find the smallest square that given tetronimos (tetris pieces) fit in to.
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.
An implementation of my fillit project, using bitwise operators.
This repository contain the questions and the solutions of each module of cs110.
Rat maze with backtracking algorithm to find path to end of maze
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.
Simple program in C to solve 9 by 9 Sudokus.
A Simple C program to act as a example to better understant Backtracking
Find minimal square to fit given tetraminos project for School21
Repositório destinado a atividades e projetos da disciplina Análise e Projeto de Algoritmos
Resolvedor do jogo 8 Puzzle utilizando backtracking, em C
Graphical Implementation of N-Queen's Algorithm using Back Tracking
A backtracking approach to find all the possible sets of operators that can be used to get a defined result from a Reverse Polish Notation (RPN) expression with missing operators.
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.
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."