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

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

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

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

The 'circular random walk' puzzle: tidy simulation of stochastic processes in R

Blog

Entropy, Free Full-Text

Artificial Intelligence in Meta-optics

Infinite chess - Wikipedia

Avoidance of Density Anomalies as a Structural Principle for Semicrystalline Polymers: The Importance of Chain Ends and Chain Tilt

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

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

The 'lost boarding pass' puzzle: efficient simulation in R