Artificial Intelligence and Creativity - Two Requirements to Solve an Extremely Complex Coloring Problem

Bernd Steinbach, Christian Posthoff

Abstract

The topic of this paper is the rectangle-free coloring of grids using four colors which is equivalent to the edge coloring of complete bipartite graphs without complete monochromatic subgraphs K2,2. So far unsolved are the grids of the sizes 17×17, 17×18, 18×17, and 18×18. The number of different 4-color patterns of the grid 18×18 is equal to 4324 ≈ 1.16798∗10195. We summarize in this paper some basic approaches in order to gain the required knowledge. Three creative approaches are steps so solve the most complex grid of the size 18×18. Two advanced creative approaches reduce the required runtime to less than 12 percent.

References

  1. Biere, A. (2010). Lingeling, plingeling, picosat and precosat at sat race 2010. Technical Report 10/1, Institute for Formal Models and Verification, Johannes Kepler University, Linz, Austria.
  2. Fenner, S., Gasarch, W., Glover, C., and Purewal, S. (2009). Rectangle free coloring of grids. http:// www.cs.umd.edu/~gasarch/papers/grid.pdf.
  3. Fortnow, L. and Gasarch, B. (2012). Computational complexity - the 17x17 problem solved! (also 18x18). http://blog.computationalcomplexity.org/ 2012/ 02/ 17x17-problem-solved-also-18x18.html.
  4. Fortnow, L. and Gasarch, W. (2009). Rectangle free coloring of grids. http://blog.computationalcomplexity.org/ 2009/ 11/ 17x17-challenge-worth-28900-thisis-not.html.
  5. Gebser, M., Kaufmann, B., Neumann, A., and Schaub, T. (2007). Logic Programming and Nonmonotonic Reasoning, chapter clasp: A Conflict-Driven Answer Set Solver, pages 260-265. Springer, Berlin, Heidelberg.
  6. Marx, D. (2004). Graph colouring problems and their applications in scheduling. Periodica Polytechnica, Electrical Engineering, 48(1):11-16.
  7. Posthoff, C. and Steinbach, B. (2004). Logic Functions and Equations - Binary Models for Computer Science. Springer, Dordrecht, The Netherlands.
  8. Steinbach, B. and Posthoff, C. (2009). Logic Functions and Equations - Examples and Exercises. Springer Science + Business Media B.V.
  9. Steinbach, B. and Posthoff, C. (2012a). Extremely complex 4-colored rectangle-free grids: Solution of open multiple-valued problems. In Proceedings of the IEEE 42nd International Symposium on Multiple-Valued Logic (ISMVL 2012), pages 37-44, Victoria, British Columbia, Canada.
  10. Steinbach, B. and Posthoff, C. (2012b). Utilization of permutation classes for solving extreme complex 4- colorable rectangle-free grids. In The 2012 International Conference on Systems and Informatics (ICSAI 2012), pages 2361-2370, Yantai, China.
  11. Steinbach, B., Posthoff, C., and Wessely, W. (2010). Approaches to shift the complexity limitations of boolean problems. In Computer - Aided Design of Discrete Devices - CAD DD 2010, Proceedings of the Seventh International Conference, pages 84-91, Minsk, Belarus.
Download


Paper Citation


in Harvard Style

Steinbach B. and Posthoff C. (2013). Artificial Intelligence and Creativity - Two Requirements to Solve an Extremely Complex Coloring Problem . In Proceedings of the 5th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART, ISBN 978-989-8565-39-6, pages 411-418. DOI: 10.5220/0004183004110418


in Bibtex Style

@conference{icaart13,
author={Bernd Steinbach and Christian Posthoff},
title={Artificial Intelligence and Creativity - Two Requirements to Solve an Extremely Complex Coloring Problem},
booktitle={Proceedings of the 5th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,},
year={2013},
pages={411-418},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004183004110418},
isbn={978-989-8565-39-6},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 5th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,
TI - Artificial Intelligence and Creativity - Two Requirements to Solve an Extremely Complex Coloring Problem
SN - 978-989-8565-39-6
AU - Steinbach B.
AU - Posthoff C.
PY - 2013
SP - 411
EP - 418
DO - 10.5220/0004183004110418