queens-problem
Here are 56 public repositories matching this topic...
🔱 8 queen, chess , problem
-
Updated
Mar 23, 2017 - C#
N Queens problem solved by Hill Climbing with Random Restart
-
Updated
Apr 21, 2017 - Java
🎲 Calculates possible placements of N queens on NxN board
-
Updated
May 21, 2017 - JavaScript
-
Updated
Jun 22, 2017 - Python
The 8 Queens Problem: GA solution
-
Updated
Aug 24, 2017 - MATLAB
-
Updated
Aug 31, 2017 - Java
Solution of N-Queens problem using backtracking programming
-
Updated
Dec 9, 2017 - C#
N-Queen Solver using Hill Climbing Algorithm
-
Updated
Apr 5, 2018 - JavaScript
Constraint satisfaction problem solver in ocaml using backtrack methods -- moved to gitlab
-
Updated
Jul 9, 2018 - OCaml
-
Updated
Aug 21, 2018 - Java
Developing a solution to the 8 queens problem
-
Updated
Feb 21, 2019 - C#
CE2103 | Extra clase #4 | Implementación de la solución al algoritmo de las N Reinas, utilizando Backtracking y mostrándo el proceso mediante hardware.
-
Updated
May 17, 2019 - C++
Here you will find my version of the algorithm that solves the Queens Problem
-
Updated
Jul 12, 2019 - C++
Solve n x n Queen's problem by backtracking (DFS)
-
Updated
Nov 18, 2019 - Jupyter Notebook
Solution of the n-Queens-Problem
-
Updated
Apr 28, 2020 - Java
In the game of chess, the queen can attack any piece that lies on the same row, on the same column, or along a diagonal. The eight-queens is a classic logic puzzle. The task is to place eight queens on a chessboard in such a fashion that no queen can attack any other queen.
-
Updated
May 27, 2020 - C
Tablero ajedrez en png de 1250 reinas colocadas de forma que no se amenazan entre ellas
-
Updated
Jun 3, 2020
Improve this page
Add a description, image, and links to the queens-problem topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the queens-problem topic, visit your repo's landing page and select "manage topics."