Witches Puzzle solving algorithm by Georg Graf This C Program solves the problem which arises, when you try to solve the puzzle in the puzzle folder on a 3 x 3 field. There are only 2 unique solutions. On a Machine with a C Compiler and "make" installed, type "make" to get the binary, and just call it. The file "karten" contains set of cards. I lost the original mapping, but the idea is as follows: ================================== upper body tail ---------------------------------- Red 1 9 Yellow 2 8 Green 3 7 Blue 4 6 ================================== So if the sum at two touching edges is 10, I can take this as a match.