Map Colouring Problem with Four Colours

Article View: comp.lang.prolog

Article #2423

#2423

From: 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'   * /   \ *
****************************************************************************

Technical Details

Message-ID: <1993Jan26.142313.6282@cc.ic.ac.uk>

Path: arc1-ca.pugleaf.net!sparky!uunet!spool.mu.edu!agate!doc.ic.ac.uk!cc.ic.ac.uk!!colinb

Show Full Headers

Complete Article Headers

Newsgroups: comp.lang.prolog
Path: arc1-ca.pugleaf.net!sparky!uunet!spool.mu.edu!agate!doc.ic.ac.uk!cc.ic.ac.uk!!colinb
From: colinb@.ic.ac.uk (Dr C. Bridgewater)
Subject: Map Colouring Problem with Four Colours
Message-ID: <1993Jan26.142313.6282@cc.ic.ac.uk>
Nntp-Posting-Host: cvcgf.cv
Organization: Imperial College
Distribution: comp.lang.prolog
Date: Tue, 26 Jan 93 14:23:13 GMT
Lines: 19