Relational modelling and solution of chessboard problems

Authors:
Rudolf Berghammer
Affiliations:
Institut für Informatik, Christian-Albrechts-Universität Kiel, Kiel, Germany
Venue:
RAMICS'11 Proceedings of the 12th international conference on Relational and algebraic methods in computer science
Year:
2011

Citing 6
Cited 0

Challenging mathematical problems with elementary solutions

Challenging mathematical problems with elementary solutions
Chessboard domination problems

Discrete Mathematics - Topics on domination
Symbolic Boolean manipulation with ordered binary-decision diagrams

ACM Computing Surveys (CSUR)
Relations and graphs: discrete mathematics for computer scientists

Relations and graphs: discrete mathematics for computer scientists
Applying relation algebra and RelView to solve problems on orders and lattices

Acta Informatica
RelView: an OBDD-based computer algebra system for relations

CASC'05 Proceedings of the 8th international conference on Computer Algebra in Scientific Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe a simple computing technique for solving independence and domination problems on rectangular chessboards. It rests upon relational modelling and uses the BDD-based tool RelView for the evaluation of the relation-algebraic expressions that specify the problems' solutions and the visualization of the computed results. The technique described in the paper is very flexible and especially appropriate for experimentation. It can easily be applied to other chessboard problems.