Exploring Properties of Icosoku by Constraint Satisfaction Approach

08/16/2019
by   Ke Liu, et al.
0

Icosoku is a challenging and interesting puzzle that exhibits highly symmetrical and combinatorial nature. In this paper, we pose the questions derived from the puzzle, but with more difficulty and generality. In addition, we also present a constraint programming model for the proposed questions, which can provide the answers to our first two questions. The purpose of this paper is to share our preliminary result and problems to encourage researchers in both group theory and constraint communities to consider this topic further.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/12/2016

Retrieving and Ranking Similar Questions from Question-Answer Archives Using Topic Modelling and Topic Distribution Regression

Presented herein is a novel model for similar question ranking within co...
research
03/02/2020

Piecewise Linear Valued Constraint Satisfaction Problems with Fixed Number of Variables

Many combinatorial optimisation problems can be modelled as valued const...
research
11/30/2019

Who Asked Us? How the Theory of Computing Answers Questions about Analysis

Algorithmic fractal dimensions – constructs of computability theory – ha...
research
12/12/2012

A constraint satisfaction approach to the robust spanning tree problem with interval data

Robust optimization is one of the fundamental approaches to deal with un...
research
11/02/2018

Algebraic approach to promise constraint satisfaction

The complexity and approximability of the constraint satisfaction proble...
research
02/15/2010

Model-Driven Constraint Programming

Constraint programming can definitely be seen as a model-driven paradigm...
research
03/29/2020

On amenability of constraint satisfaction problems

Recent results show that a constraint satisfaction problem (CSP) defined...

Please sign up or login with your details

Forgot password? Click here to reset