Eric Fox's Puzzles

       Draw a non-intersecting loop through the centers of some cells which visits each shaded region at least once and passes through every circle. 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).  The loop must turn on black circles and travel straight through the cells on either side. The loop must go straight through white circles, and turn in at least one of the cells on either side. Solve online

     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...

       Draw a non-intersecting loop through the centers of all cells. 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).      In this puzzle, a question mark can represent any positive integer. Solve online

      Draw a non-intersecting loop through the centers of some cells so that the rules of each genre are met.     Masyu (Top left):      The loop must pass through each circle. The loop must turn on black circles and travel straight through the cells on either side. The loop must go straight through white circles, and turn in at least one of the cells on either side.     Ovotovata (Top right):      The loop must visit 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). A question mark can represent any positive integer.     Yajilin (Bottom left):      The loop may not pass through clued cells. No two empty cells within the bottom left quadrant may share an edge. Clues represent the number of empty cells in a strai...

     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).     In this puzzle, a question mark can represent any positive integer. Solve online

       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

     Ovotovata is another genre of my own creation from about three months ago. This is a small example puzzle I constructed then to demonstrate the ruleset.      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