me and my younger brother thought of like a weird game thing today and i want to know if there's a name for this
so you've got a 4x4 grid of circles, any two of which can be filled in.
Now, you take an imaginary marker (an X below) and start at any circle. Your goal is to touch every empty circle exactly once, you can't touch filled-in circles and you can't touch the same circle more than once. You can only move vertically or horizontally, not diagonally.
So for the grid above one solution is this:
So that's the principle of the thing, and I've got a couple questions. Bare with me, I'm real bad at math.
1. someone has presumably thought of this before, is there a name for it?
2. are there any configurations where this is unsolvable?
3. is there some kind of rule you could write to figure out what configurations would be unsolvable without actually doing them?
and anything else you want to bring up is fine too.
idk I thought it was interesting, maybe not, but hopefully so.
Comments