Best Total: 20m 22s
|Posted - 2009.04.12 03:44:53|
I was thinking a bit about edge pair restrictions, and I discovered that I had missed something they could do. (and as a result, my solver cannot take advantage of this...)
In this puzzle, some advanced use of edge pair restrictions allows for static proof of two lines meeting at the 0, without a trial.
However, this scenario seems hideously contrived, and I am wondering whether anyone uses this kind of analysis regularly during solving of puzzles?