Skip to content

Muradmustafayev-03/8-Queens-Problem

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

3 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

8-Queens-Problem

Realisation of the solution for the 8 Queens problem

Written in OOP paradigm so that the code is absolutely flexible.

Uses a recursive algotithm.

Normally, works up to 16x16 size board (int size = 16).

For each start_row finds one solution.

Possibly, can find all the solutions if code be change a little.

About

Realisation of the solution for the 8 Queens problem

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages