tag:blogger.com,1999:blog-5276958884676424644.post2952517506697462311..comments2018-01-03T16:20:19.670+01:00Comments on Slow Frog: Solving Hexiom (perhaps you can help)Laurent Vaucherhttp://www.blogger.com/profile/13286811917069686050noreply@blogger.comBlogger1125tag:blogger.com,1999:blog-5276958884676424644.post-72335863096053425512012-02-02T06:38:04.389+01:002012-02-02T06:38:04.389+01:00If you're interested in a mathematical approac...If you're interested in a mathematical approach, one idea is this: Your available cells basically give you a graph (in the "graph theory" sense), while the numbers on all the tiles give you a "degree sequence". A degree sequence (where each element in the sequence corresponds to a vertex in a graph and its value specifies the number of adjacent vertices in the graph) generates a finite number of graphs. What your task basically boils down to is finding the graph generated from the degree sequence that is also a subgraph to the one generated from the available "cells".<br />This doesn't take into account the "locked" tiles (except to place further constraints on the matching graph), but it might be a good place to start. Do some reading on wikipedia and mathworld to see if there are any algorithms out there that might prove useful.marcelbhttps://www.blogger.com/profile/10048995223718394863noreply@blogger.com