Awani Kumar, a conservator of forests here, devised 1,300 solutions to the problem that is based on how knights move on a chessboard. Instead of the conventional chessboards that have eight rows of squares horizontally and vertically, Kumar based the mathematical problem on rows of 12.
He figured out the most number of ways a knight can jump around this type of empty board while following the chess pattern but without visiting any of the squares more than once.
'I have been working on the problem since 1998,' said Kumar, who has a B.Tech. degree from the Indian Institute of Technology, Bombay.
The Indian Forest Service officer, who lives in Gomti Nagar here, said he has also mapped a tougher Magic Tour of Knight using a cube made up 12 vertical and horizontal rows on each of the four sides.
