Map Colouring Problem with Four Colours

Thread View: comp.lang.prolog

1 messages

[T] Back to Threads [V] Tree View [G] Group Articles

1 total messages Started by colinb Dr C. Bridgewater Tue, 26 Jan 1993 14:23

#2423

Author: colinb Dr C. Bridgewater
Date: Tue, 26 Jan 1993 14:23

18 lines
1237 bytes

Hi Folks,

There is a classic problem where a 2-D map of regions needs to be coloured
in such a way that no adjacent region has the same colour. It turns out 
that the maximum number of colours needed to fill in the map is four. Does 
anyone happen to have a solution to this problem on-line ? 

Cheers,

Colin

****************************************************************************
*  Colin Bridgewater		     *    c.bridgewater@uk.ac.ic   * \   / *
*  Head Robot Wrangler		     * tel:+44-(0)71-589-5111x4842 *  \ /  *
*  Construction Robotics Research    * BE KIND TO SPIDERS & SNAILS * --*-- *
*  Department of Civil Engineering   *  -------------------------  *  / \  *
*  Imperial College, London, UK.     *  alias 'the happy hacker'   * /   \ *
****************************************************************************

Thread Navigation

This is a paginated view of messages in the thread with full content displayed inline.

Messages are displayed in chronological order, with the original post highlighted in green.

Use pagination controls to navigate through all messages in large threads.

Back to All Threads