The 'knight on an infinite chessboard' puzzle: efficient simulation in R – Variance Explained

PDF) An Efficient Algorithm for the Knight's Tour Problem

Non-intersecting chessboard paths – Book Proofs

Efficient simulations in R - Grant R. McDermott

Jesse Galef Measure of Doubt

Blog

How many unique spaces can a knight be in after n moves? After 1 move it can be in 8, after 2 it can be in 33, but what's the pattern? - Quora

I had an artificial intelligence create a chess puzzle, but I can't solve it. What's the solution? : r/AnarchyChess

probability - Given a knight on an infinite chess board that moves randomly, what's the expected number of distinct squares it reaches in 50 moves? - Mathematics Stack Exchange

Artificial Intelligence - Zsolt Ercsey by PTE_MIK_English_edu_material - Issuu

DBA Consulting Blog

Given an infinite chessboard, initially there is a knight in a certain square. After 100 moves, how many squares does the knight get? - Quora

Knight's move on infinite chess board with constant time and space, by Adem Atalay

PDF) An Efficient Algorithm for the Knight's Tour Problem

CryptoPunkets #828 - CryptoPunkets

PDF) An Efficient Algorithm for the Knight's Tour Problem