In each puzzle, fill the circles with the numbers 1, 2, 3, ... n, where n is the number of circles in such a way that consecutive numbers are NOT in circles that are joined by a line.
$\begingroup$
$\endgroup$
Add a comment
|
1 Answer
$\begingroup$
$\endgroup$
1
These both seem pretty straightforward to solve.
Solution for puzzle 1:
Solution for puzzle 2:
-
$\begingroup$ I agree that these two puzzles aren’t very tough. You might want to check out my 2nd set of this type of puzzle, there a little bit more challenging. You can find the 2nd set at: puzzling.stackexchange.com/questions/116473/… $\endgroup$ Jun 29 at 23:34