The name of the puzzle is color-ken-ken.
Load init-color-ken.
Ok.
The name of the action is write-1-to-4.
You can write a number that is between one and four onto an empty location.
If the value of a location is absent then the location is empty.
The solution has four steps.
Load fail-color-ken2.
The name of a failure is same-row-value.
Ok.
If the row of a location is the row of a location and the value of the former location is the value of the latter location then you lose.
The name of a failure is same-col-value.
Ok.
If the column of a location is the column of a location and the value of the former location is the value of the latter location then you lose.
Load final-color-ken.
The name of the goal is all-filled.
Ok.
The goal is that all locations are filled.
If the value of a location is more than zero then the location is filled.
Load fail-color-ken.
The name of a failure is group-sum-10.
Ok.
If the locations in a group are filled and the sum of the values of the group is not ten then you lose.
If the blocks have the same color then they are in a group.
Done.
No.