Solution for Knights Tour problem | Google Interview Question
This problem was asked by Google.
A knight's tour is a sequence of moves by a knight on a chessboard such that all squares are visited once.
N, write a function to return the number of knight's tours on an
Please check the main.js snippet for the solution.
This solution originally posted at: Github by @Murillo2380