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

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

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

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

Infinite chess analysis mode in Fritz/Rybka

Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques [2 ed.] 9781461469407, 1461469406

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

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

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

All Posts – Variance Explained

Novel Shade Dispersion Techniques for Reconfiguration of Partially Shaded Photovoltaic Arrays

Why can't a knight visit all the squares of a 5 by 5 chessboard exactly once by knight's moves and return to its starting point? - Quora

DBA Consulting Blog

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

Infinite chess - Wikipedia

Entropy, Free Full-Text