|This is a simple game of logic using a number of differently coloured tiles arranged in a grid. The object is to convert the complete grid to tiles of a single colour. The rule for conversion is given by the four tiles at the top left corner as a template. The game as described below is not very difficult and not particularly exciting, but it looks as if it could be fertile ground for analysing to see if there are 'best' strategies and provable maximum number of steps required to reach a solution from any pattern. Also worth analysis is a harder version which might have positions that are insoluble.|
Once loaded you can disconnect from the network to play.
Go back one turn
Using the program
To see the operation of the rules click on ‘NORMAL PLAY'.
Notice how the bottom two tiles in the fourth column match the pattern of the top two
tiles in the first column. Since this is a match we will put the same tile into column
five row six as column two row two. We expect to see the pink star replaced
with a green blob... Click on Apply rule and see this happens as predicted.
You may also have noticed that the rightmost tile in the top row was also changed
to a green blob. (Click on Go back one turn to see this again.)
This has happened because the green blob we just substituted on the bottom
row is now a candidate to be above the red and yellow star on the top row
and this again matches our template. Because we look for patterns in a definite
sequence, left to right on working our way down the rows this is the next to last place
tested, the top tiles being 'below' the bottom row. With this example you can
continue applying the rule without making any changes and the pattern solves itself!
Normally the pattern needs intervention. Clicking on a tile changes it in a cycle thus you may need to click more than once to get to the tile you desire. During setup you can alter any tile. During normal play you can alter any of the four tiles in the template corner. During hard play you can't alter the very top left tile manually and may therefore need to scheme to get the application of the rules to do it for you.
If you click on apply rule and the turn counter stays the same then no substitutions could be found.
The code and page as supplied are copyrighted. You can copy and adapt it freely but you must acknowledge the original authorship and may not pass it off as all your own work.
InvestigationsI've been an interested observer as clever proofs are devised to show how certain game strategies are optimal or what the provable worst case might be. Also how some puzzles appear not to have very good heuristic functions. I don't think the Lammas puzzle is particularly challenging when compared with say a rubik cube but I suspect that many of the same features are there but with a lesser complexity but more potential for variation with altered conditions.
One thing I'd like to know is what percentage of 4-tile,6x6 grid patterns are self solving. Ie need no intervention required. The self-solving example provided just happened to be the first I tried.
I suspect that larger grids don't need many more goes than smaller ones. Is there a number of goes is guaranteed to be the maximum required for any sized grid (for a given number of tiles).
If you have any thoughts, trials or analytical results then please e-mail me and I'll maintain links and or a review on these pages.