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

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

DBA Consulting Blog

Infinite Chess Infinite Series

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

Atmosphere, Free Full-Text

Effective Markovian description of decoherence in bound systems

Introduction to Reinforcement Learning

Novel Shade Dispersion Techniques for Reconfiguration of Partially Shaded Photovoltaic Arrays

Bitcoin #170 - Coinopolys

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 Tour Problem - Javatpoint