/DiagonalsPuzzle

Algorithm using backtracking to find a sequence of N diagonals not touching each others in a square of N size

Primary LanguagePythonMIT LicenseMIT

DiagonalsPuzzle

Algorithm using backtracking to find a sequence of N diagonals not touching each others in a square of N size