Abstract:
A finite state automation of 4 stones is constructed to make the round of $\mathbb{Z}^k$ for a polynomial time. Some estimates of the optimal number of stones are discussed.
Keywords:The state machine, stone, crawling $k$-dimensional space, polynomial time visiting points.