Posts

Showing posts with the label Yoque

#379 - Yoque

Image
       Connect some pairs of orthogonally adjacent dots to form paths connecting pairs of circles. Each path must turn exactly once, and each path must be crossed exactly once by another path. Two perpendicular line segments may intersect each other, but not turn or stop at their intersection or otherwise overlap. Two circles containing the same letter must be ends of the same path. Two circles containing different letters may not. Solve online

#375 - Yoque

Image
     Recently I went on a genre-inventing spree, and now I have three more finalized ones that I'm ready to share, the third being Yoque!     Connect some pairs of orthogonally adjacent dots to form paths connecting pairs of circles. Each path must turn exactly once, and each path must be crossed exactly once by another path. Two perpendicular line segments may intersect each other, but not turn or stop at their intersection or otherwise overlap. Two circles containing the same letter must be ends of the same path. Two circles containing different letters may not. Solve online

#374 - Yoque

Image
       Recently I went on a genre-inventing spree, and now I have three more finalized ones that I'm ready to share, the third being Yoque!     Connect some pairs of orthogonally adjacent dots to form paths connecting pairs of circles. Each path must turn exactly once, and each path must be crossed exactly once by another path. Two perpendicular line segments may intersect each other, but not turn or stop at their intersection or otherwise overlap. Two circles containing the same letter must be ends of the same path. Two circles containing different letters may not. 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...