Four-Color Coloring of a Partial Map of Europe
Abstract
The four-color theorem states that any map in a plane can be colored using four-colors in such a way that regions sharing a common boundary other than a single point do not share the same color. In this article we attempt to color a partial map of Europe with four color using Artificial Intelligence techniques, defining it as a Constraint Satisfaction Problem (CSP). The algorithm created was succeeded to find all four solutions of the problem.
Keywords
four-color theorem; Artificial intelligent; Constraint Satisfaction Problems (CSP); Europe map
Full Text:
PDFDOI: http://dx.doi.org/10.21533/scjournal.v5i2.117
Refbacks
- There are currently no refbacks.
Copyright (c) 2016 Mehmet Can
ISSN 2233 -1859
Digital Object Identifier DOI: 10.21533/scjournal
This work is licensed under a Creative Commons Attribution 4.0 International License