March 15, 2010

Problem of the Week

for Monday, March 15, 2010

Can you make a closed path through the grid of dots below so that for each numbered square the path uses exactly that many of its edges? For instance, if a square has a 2 in it, then exactly two of its sides must be part of the path. The path must be one and only one continuous loop, using only horizontal and vertical edges. (There are no restrictions on what can happen for an unnumbered square.)

Winners of the continuous loop challenge