Grout
Grout is a Java 1.1 program which solves tile-placing, 辛勝する／優位-matching puzzles. It runs under the Sun JVM, the 解放する／自由な OpenJDK and the Kaffe VM (albeit だいたい twice as slowly last time I checked). Puzzles may be of the sort where an 辛勝する／優位 matches itself ('red' matches 'red') or where an 辛勝する／優位 matches its pair ('前線' matches '支援する').
Grout 1.1 only supports puzzles using tiles which have either four 味方するs (square) or six 味方するs (hexagonal). For hexagonal tiles, the board is either hexagonal or triangular. It 作品 this out from the number of tiles, which means that only puzzles with 確かな number of tiles are 受託するd. Grout can also 生成する hexagonal puzzles of the sort shown to the 権利. The 一括 comes with 指示／教授／教育s and several 見本 puzzles.
You can get physical puzzles of the sort Grout solves from Lagoon Games.
History
I won the 2001 Oxford University Programming 競争, "Mental Hexercise", with this bit of code, which is the forerunner to Grout. It solves a 明確な／細部 class of six-味方するd self-matching puzzles (as illustrated). An 遭遇（する） in 早期に 2005 with a four-味方するd pair-matching puzzle from Lagoon Games at a friend's house 奮起させるd me to generalise the code. In the end, a bug 妨げるd me finding the 解答 to that puzzle; I had to look it up. However, having used the answer to find the bug, Grout then 設立する a second possible 解答. This 見解／翻訳／版 was Grout 1.0.
In 2008, マイク Spivey (who runs the programming 競争) used this problem again, but this time requested that triangular boards also be solved. For my own 利益／興味, I 高めるd Grout to do so, resulting in Grout 1.1.
Why "Grout"? 井戸／弁護士席, grout sticks tiles together :-) It's also in honour of my University maths 教える, Dr. Peter Grout, who bore with superhuman patience my incompetent 試みる／企てるs to learn enough maths to do Chemistry. In the end, I gave up and switched to Computer Science, a course with a far smaller maths content. But I almost always enjoyed his classes, even if the enjoyment was occasionally tinged with 恐れる.