Connect all dots by one stroke.

[ttokoro]

Puzzle only to fun. Question graphs are made by using Mathcad programing.

For exsample of Level 4.

For the exsample of Level 10.

And this is the problem I find in WWW. Level 7.

[ttokoro]

This puzzle is very difficult for students to solve.

Therefore, even using Mathcad, it is too hard to solve.

( This is only a puzzle to fun! ) 

Tokoro

[Werner_E]

---

@ttokoro wrote:

This puzzle is very difficult for students to solve.

Therefore, even using Mathcad, it is too hard to solve.

---

Not even if done by brute force using recursion?

BTW, whats the meaning of n (0,1,2,3) in your screenshots?

[Werner_E]

Here is a brute force solution.

The starting point is manually set. No error check is done yet as to if the starting point is an existing point 😉

It should be easy to write a wrapper which cycles through all possible starting points trying to find one which yields a solution.

Its just a quick hack and quite inefficient. Especially when the layout does not allow a solution the sheet takes quite some time to realize that 😉

There may even be an error in my recursion?

[ttokoro]

m=20

n(0,1,2,3) only choses the position of vacancy point on the m*m points graph. ( In this figure, the location of  star points.)

Showing level 4(m=4) for example and try to level 7(m=7).

Elementary and junior high school students try to answer all from (a), (b), (d) and finally (c). This is my strategy of my puzzle class to fun this puzzle.

[ttokoro]

Blue dots are 25. Red dots are 23. Therefore you can't connect all dots by one stroke.
This is odd and even puzzle. 24 and 24 or 25 you can.