Game overview
Fill all blocks with one stroke.
This kind of problems are also known as Hamiltonian path problem in graph theory.
There is only one solution to each level.
There is only one solution to each level.
Developer
More games by chrysalistw
Fill all blocks with one stroke.
Skich uses cookies and similar technologies to provide, improve, secure and analyse our services. By clicking "Accept All", you agree to let us use our own and third party cookies according to Cookies Policy.