#423 - 2x Mini Haisu

     Draw a non-intersecting path through the centers of all cells, starting from the S (start) and finishing at the G (goal). Each clued cell must be traveled through on the path’s Nth visit to the region the clue lies within, where N is the value of the clue.

Solve online

Solve online



Comments

Post a Comment

Popular posts from this blog

#41 - Tentaisho / Star Battle Hybrid

Image
      This puzzle is mostly a proof of concept, which is why it's so small and isn't very logically interesting. I've seen several attempts at a Tentaisho Star Battle hybrid, but I've seen no successful ones without additional rules. My ultimate goal is a 10x10 one with two stars, but the best I've managed so far is a 6x6 one with one star.      Divide the grid into regions of orthogonally connected cells. Each region must contain exactly one circle and have 180° symmetry around it. Additionally, p lace stars into some cells such that each row, column, and outlined region contains exactly one star. Stars may not touch one another, not even diagonally. Solve online
Read more

#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 amount of shaded cells. There may not exist a run of more than three consecutive shaded or unshaded cells horizontally or vertically anywhere in the grid. Solve online                                            
Read more

#437 - Square Jam

Image
     I've created another puzzle genre that I'm excited to share. Here it is: Square Jam!      Divide the grid into square regions of orthogonally connected cells. A number indicates the side length of the square it’s in. Region borders may not form any four-way intersections. Solve online
Read more

#490 - Aqre

Image
       Shade some cells so that all shaded cells form one orthogonally connected area. Regions with numbers must contain the indicated amount of shaded cells. There may not exist a run of more than three consecutive shaded or unshaded cells horizontally or vertically anywhere in the grid. Solve online
Read more

#160 - Matryoshka Fillomino

Image
     This is a Fillomino puzzle that works and has a different solve path no matter how many layers you chop off the edges.      Divide the grid into regions of orthogonally connected cells. Two regions of the same size may not share an edge. Clued cells must belong to a region containing the indicated number of cells. Solve online Solve online Solve online Solve online Solve online Solve online
Read more