Done, no green.

Done

g/ng - nice

UTH: the score does depend to some extent on the order in which I scan the grid. When I tried to implement the program in JavaScript (too slow) I got slightly different scores because I was scanning the grid in a different order.

finished ... nice puzzle ... no greens

Difficulty score 34. No green.

Done.

done

dng

Dr. W. When your program gets to the stage where it needs to make a guess (I'm assuming it does), does it count that as no possible moves? Or, since any free cell could take a guess, does it count that as 15 or so possible guesses? Or since a binary option is the best for guessing, does it count those? And how does it score when one guess alone doesn't solve it but you need a tree of guesses?

go

go

done

done.

No green. One very productive and lucky guess.

Go

Done with greens