Moon or Sun

For my 100th puzzle, I’ve made my first giant: a 36×20 Moon or Sun.  I’ve been working on this one incrementally over the last two months, so it’s a bit of a hodgepodge.  This is a fun type to work with, though it can be challenging to prevent uniqueness-forces from giving away the solve path.

PDF Moon or Sun

Moon or Sun Expert 07-01.png


Standard Moon or Sun Rules


Killer Bossa Nova

For my 99th puzzle on this blog, I revisited my archives and brought out another Killer Bossa Nova, designed in October 2007.

A-06-Killer Bossa Nova.PNG


Standard Bossa Nova Rules.  Clues are given as cages in which numbers must add up to the given value.  Numbers may repeat within cages.

Proximity Snake

This is an adaptation of various Snake types to a [; 33.42] tiling.


Draw a snake through cells between the two given ends such that:

  1. The snake does not branch or cross itself.
  2. The snake does not touch itself on an edge.  If two cells that share an edge are part of the snake, the snake must be passing through that edge. The snake can touch itself on a vertex (“diagonally”).
  3. Numbers in certain cells indicate how many of the cells that share a vertex with the numbered cell are occupied by the snake.  The snake cannot pass through numbers.


Dodecagon Square Joint Proximity Snake ExampleDodecagon Square Joint Proximity Snake Example Solution


All of the puzzles can be found organized in this printable PDF, or in the images below.

PDF Proximity Snake

01. Easy

 Dodecagon Square Joint Proximity Snake Easy 01

02. Medium

Dodecagon Square Joint Proximity Snake Medium 02

03. Hard

Dodecagon Square Joint Proximity Snake Hard 03

Deltoidal Trihexagonal Tree

This type is an adaptation of Branch (ブランチャー) by Inaba Naoki to a Deltoidal Trihexagonal grid.


Draw segments to create a network such that:

  1. Every vertex • and node O is connected.
  2. Vertices must connect to exactly two path segments.  Every branch of the network must form a path from one node to another.
  3. Numbers indicate the sum of the lengths of every branch directly connected to that node, in segments.
  4. The network is acyclic – there are no loops.


Deltoidal Trihexagonal Tree ExampleDeltoidal Trihexagonal Tree Example Solution


All of the puzzles can be found organized in this printable PDF, or in the images below.

PDF Deltoidal Trihexagonal Tree

01. Medium

 Deltoidal Trihexagonal Tree Medium 01

02. Hard

Deltoidal Trihexagonal Tree Hard 02

03. Expert

Deltoidal Trihexagonal Tree Expert 03