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

Rules

Standard Moon or Sun Rules

Proximity Snake

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

Rules

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.

Example

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

Puzzles

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.

Rules

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.

Example

Deltoidal Trihexagonal Tree ExampleDeltoidal Trihexagonal Tree Example Solution

Puzzles

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

Killer Tetrakis Square

Here is a type that borrows some constraints from Aziz Ates’ Triangular Skyscrapers puzzle in the 2016 US Puzzle Championship practice test.   The result is a close cousin of my specialty, Killer Sudoku, so I’ve made these puzzles harder than normal.

Rules

Fill numbers into the grid of four rows and four columns of 8 cells each such that:

  1. Every row and column contains each integer from 1 to 8 exactly once.
  2. Cages, represented by dotted lines, indicate the sum to which all included cells must add.
  3. Numbers may not repeat within a cage
  4. Each number must appear exactly once in each of the four triangle orientations (pointing NE, NW, SE, SW)  All of the “1” cells are highlighted in the example answer to demonstrate this.

Example

Killer Tetrakis Square ExampleKiller Tetrakis Square Example Solution

Puzzles

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

PDF Killer Tetrakis Square

01. Medium

 Killer Tetrakis Square Medium 01

02. Hard

Killer Tetrakis Square Hard 02

03. Hard

Killer Tetrakis Square Hard 03

04. Expert

Killer Tetrakis Square Expert 04

05. Expert

Killer Tetrakis Square Expert 05

6 Axis Logic Grid Puzzle

Here is the first logic grid puzzle I’ve designed in about 15 years, written for the XKCD forums.  I normally don’t post language-based puzzles but the forum only allows text posts for new users.  The community at logic-puzzles.org has worked this one out.  Well Done BlackFiresong.  See the full article for spreadsheets and solutions.

Introduction

Here is a 6-axis logic grid puzzle with an F1 Racing theme.  Everything I know about F1 racing I googled today, so actual knowledge is neither necessary nor helpful.  Names of manufacturers, car numbers, drivers, and countries of origin have all been fictionalized.  A driver with a German sounding name is not necessarily from Germany, and a team can be from any country, regardless of its real-world origin.  The only correlations come from the following clues.

Structure

There are 6 drivers with the following names:
  • Daniel
  • Max
  • Sebastian
  • Nico
  • Kimi
  • Romain
Each driver is from one of the following 6 countries, one driver per country:
  • Germany
  • UK
  • Norway
  • Sweden
  • Japan
  • USA
Each driver is on one of the following teams, one driver per team:
  • Red Bull
  • Ferrari
  • Mercedes
  • Haas
  • McLaren
  • Renault
Each driver has a car with a unique number from one to six, one number per driver.
Each driver placed in first through sixth place in the qualifying round and each driver placed first through sixth in the final race.  There were no ties.
There is a total of six axes: Name, Country, Team, Car Number, Qualifying Position, and Final Position.
Identify all values for each driver.

Clues

  1. Every team whose name has an adjacent pair of identical letters is associated with an odd-numbered car.
  2. For every driver whose name has fewer than three vowels:
    1. The difference between the qualifying position and final position is odd.
    2. The sum of the qualifying position, final position, and car number is a prime number.
  3. For the driver from Germany:
    1. Car number < qualifying position < final position.
    2. The sum of these three numbers is a prime number.
  4. For the Red Bull driver:
    1. Car number > qualifying position > final position.
    2. The sum of these three numbers is a prime number.
  5. For the driver from Norway:
    1. Qualifying position and final position are the same.
    2. The sum of the qualifying position, final position, and car number is a prime number.
  6. For the driver from UK:
    1. The sum of the qualifying position, final position, and car number is 10.
  7. Daniel doesn’t drive for Haas.
  8. Daniel is not from Norway.
  9. If you were to arrange the list of teams and the list of countries in alphabetical order and place them side by side, there would be no correlations. (The alphabetically first team is not from the alphabetically first country, second team is not from the second country, etc.)
  10. If you were to arrange the list of names and the list of countries in alphabetical order and place them side by side, there would be exactly two correlations.
  11. Sebastian’s final position is divisible by 3.
  12. Japan’s qualifying position is divisible by 3.
  13. Sebastian is not from the UK.
  14. Ferrari is not from the UK.
  15. Romain is not in car number 1.
  16. Either Nico or Kimi is from the USA.
  17. The McLaren team placed neither 1st nor 6th in the qualifying round.
  18. Mercedes is not driven by Max.

Logic Grid F1 - Solving Grid

Continue reading “6 Axis Logic Grid Puzzle”