Posts

Showing posts with the label U-Turns

#434 - U-Turns / Password Path Hybrid

Image
       Draw a non-intersecting path through the centers of some cells which passes through every white circle and every letter, but not through any black circles. Grey circles mark the ends of the path. Starting from one grey circle,  the path must travel through the letters in the given password, in order, repeatedly until the second grey circle is reached.  Between each pair of circles the path uses, the path must turn exactly twice, and both turns must be in the same direction. Solve online

#392 - U-Turns

Image
       Draw a non-intersecting path through the centers of some cells which passes through every white circle and no black circles. Grey circles mark the ends of the path. Between each pair of circles the path uses, the path must turn exactly twice, and both turns must be in the same direction. Solve online

#391 - U-Turns

Image
       Draw a non-intersecting path through the centers of some cells which passes through every white circle and no black circles. Grey circles mark the ends of the path. Between each pair of circles the path uses, the path must turn exactly twice, and both turns must be in the same direction. Solve online

#369 - U-Turns

Image
     Recently I realized that none of my original genres contain the letter U yet, so I made a genre themed around it to change that.      Draw a non-intersecting path through the centers of some cells which passes through every white circle and no black circles. Grey circles mark the ends of the path. Between each pair of circles the path uses, the path must turn exactly twice, and both turns must be in the same direction. Solve online

#300 - My Original Genres

Image
     For my 300th post, I've put together a collection of example puzzles for all of my original puzzle genres. As I create more in the future, this post will get updated. I hope you enjoy!     1.  Ovotovata  (oh-VOH-toh-VAH-tuh)      Draw a non-intersecting loop through the centers of some cells which visits each shaded region at least once. When the loop exits a clued region in any direction, it must travel in a straight line for exactly the indicated number of cells (turning on the Nth cell, where N is the value of the clue). Solve online                                                    Solve online View solutions     2.  Aqre  (AY-kurr)      Shade some cells so that all shaded cells form one orthogonally connected area. Regions with numbers must contain the indicated am...