not sure about your solution, pls enlighten mecan you define so-called hamilton path?

一道思索数年的小学题目一. 一段经历: 思考数年的问题 初中时，妹妹问了我一个问题： 如下图，相邻2点的间隔是1，只能横连和竖连（当然，间距只能是1），你能一笔把这些点都连起来吗（不重复）？如果能，请，给出连的结果；如果不能，请给出理由. 当时我苦思冥想都没得到一个合理的结果来。直到进入高中后的某一天，我恍然大悟... 二. 数学转换 现在，我们把他转化成一道正规的数学题吧: Does this graph have a Hamilton Path? 三. 一点引申: Does this graph have a Hamilton Path? 试问：你能给出一个人人都懂的答案吗？ (more...)

some of your statement is wrongif you want just go through , no need to come back then can have one point with odd number of paths linking out... I think it's wrong. Make a simple example. 5 points in a straight line. got 2 points with odd number of path, right? From what I have known, to be a shape that can go through at once, it will have the property below. The point of odd number of paths linking out should be less than 2 or even number. However, not all the shapes fulfil this requirement can be a euler circle.

wrong...Hamilton Path和Euler circle完全是2个不同的概念 简单来说，Hamilton Path是包含所有点的一条路径，而且在这条路径上，每个点刚好出现一次

wrong...Also，you should express youself understood by people even at low level