Martin's Logic Puzzles

Friday, August 28, 2009

Graph Colouring #3

An easy colouring problem. (1-3)

Labels:

Wednesday, June 20, 2007

Graph Colouring #2

I was bored at a conference and drew this. I think there isn't too many tricks that can be done with this kind of a puzzle, or maybe I'm just not imaginative enough.


Labels:

Monday, April 9, 2007

Graph Colouring #1

I hastily produced one puzzle, which should be pretty simple. There's only one small trick to it...

Labels:

Graph Colouring Instructions

Here is a classic graph theory problem: Put numbers (or "colours") 1, 2, or 3 into each circle so that adjacent circles receive different numbers. I guess some puzzles may use more colours, and that will be indicated for each puzzle.

Here is a simple example:

Notice that the circle on the top is adjacent to circles already coloured 1 and 2. So that circle must be coloured with 3. Then the circle on the right must be coloured with 1. So the solution for this puzzle is
.

Labels: ,