GitHub - CarrotAsh/chess_knights_problem: The aim is to solve a variant of the chess queens problem, using knights instead, to find out how many knights can be present on a chessboard without threatening each other. Any configuration of knights on the board is valid as long as they do not threaten each other, but you want to find the maximum number of knights.

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 32 Commits
.idea		.idea
.gitignore		.gitignore
search.py		search.py

About

The aim is to solve a variant of the chess queens problem, using knights instead, to find out how many knights can be present on a chessboard without threatening each other. Any configuration of knights on the board is valid as long as they do not threaten each other, but you want to find the maximum number of knights.