The 6×6 Points Connection Problem
![]() In challenge 2 you are not allowed to visit the same grid point twice (neither as an endpoint nor as an intermediate point of a segment). In challenge 3 you have to find a closed polyline that visits all grid points. Here you are allowed to visit any grid points more than once, but note: There is a solution that (apart from the start- and endpoint) visits no grid point twice. Can you find it? ![]() "The 6×6 Points Connection Problem" from The Wolfram Demonstrations Project http://demonstrations.wolfram.com/The66PointsConnectionProblem/ Contributed by: Karl Scherer | ||||||||||||||
![]() | ||
|
|
||














Browse all topics















