Source

This is a solution for the problem of the knights tour wherein a knight on a chess board is only allowed to visit each location once. This solution is for a 130×130 board and required a neural net to solve. Notice the interesting “blobs” forming near the centre and the repeated patterns on the edges.

 

Source

And here is a quick demo of what the knights tour exactly is.