Hi François,
Congratulations for your programming and the resolution that follows.
Obviously as you know, the same resolution can be done with tracks or anti-tracks, but here is a different resolution based on the only exploitation of the two tracks from the 4B1 pair. It is here a progressive construction of the two tracks, but we could make a global construction which would allow us to note that P(4r1c2) is invalid and that P(4r3c2) covers the puzzle which is thus of level 1 TDP.
-Step 1)
Reduction of the puzzle by TB.
-Step 2)
P(4r1c2) : 4r1c2->(
9r1c5 and 3r1c1->3r8c3->
7r7c2->...)
P(4r3c2) : 4r3c2->7r3c3->(
7r7c2 and 1r3c5->
9r1c5)->...
=> r1c5=9, r7c2=7 and reduction of the puzzle by TB.
So we continue the construction of the two tracks like this:
-Step3)
P(4r1c2) : ...->(
5r1c6 and
3r5c4)->...
P(4r3c2) : ...->(
1r7c6->6r7c1)->4r7c5->8r6c5->
3r5c4->...
=> r5c4=3, -5r7c6 donc r7c7=5 and reduction of the puzzle by TB.
So we continue the construction of the two tracks like this:
-Step4)
P(4r1c2) : ...->(1r3c2 and 5r6c3->24r6c89->8r5c7->1r5c3)->
1r9c5->...
P(4r3c2) : ...->
8r6c5->...
=> -8r9c5 donc r9c4=8 and reduction of the puzzle by TB.
So we continue the construction of the two tracks like this:
-Step5)
P(4r1c2) : ...->8r2c3->
9r2c1->...
P(4r3c2) : ...->3r1c2->3r6c3->3r8c8->
9r2c1->...
=> r2c1=9 and reduction of the puzzle by TB.
So we continue the construction of the two tracks like this:
-Step6)
P(4r1c2) : ...->(6r8c1 and 5r4c8->9r4c7)->
4r8c7->...
P(4r3c2) : ...->5r2c6->4r2c9->
4r8c7->...
=> r8c7=4, stte.
Friendly
Robert