# Exploring Properties of Icosoku by Constraint Satisfaction Approach

## TL;DR

This paper investigates the Icosoku puzzle's properties using a constraint programming approach, posing more complex questions and providing a model to find solutions, aiming to stimulate further research in related fields.

## Contribution

It introduces a new constraint programming model for analyzing Icosoku and formulates more difficult, generalized questions about its properties.

## Key findings

- Proposed a constraint programming model for Icosoku.
- Formulated more challenging questions about the puzzle.
- Shared preliminary results to encourage further research.

## Abstract

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.