I wrote: .... True. Furthermore, there's no reason not to have chains on the outside rims of the puzzles. One could know, for example, whether r6c1 is GT or LT its wrap-around neighbor at r6c9. ....
Define a
complete GTLT grid as one that has GT and LT signs on all cell boundaries, including those on box borders, and also including the wrap-arounds. Such a grid would always have exactly 81 GTLT signs.
Obviously, by adding extra GTLT signs to any valid (one-solution) puzzle, you would create a complete grid with only one solution.
Or, by making sure one of those extra signs is wrong, you could create one with no solutions.
So, what is the
largest number of solutions any complete GTLT grid could have?
Bill Smythe