dun have, becoz got points with odd linking

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

ha? is the simplified version of Euler circle?if you want to have any EUla circle, then every points must have Even path linking out if you want just go through , no need to come back then can have one point with odd number of paths linking out...

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

Newton knows the answer