Sorry for the mistake in my first post and do allow me to try again!
Further to the work done on the Eppstein's hard puzzle, I constructed a combined bivalue & bilocation graph for this puzzle. From this graph, (correct me if I am wrong as I am still not 100% confident with the technique) a chain was identified. This chain consists of a combination of bivalue and bilocation edges.
Using Scott's notation:
[A:78:4*]<-4>[99:4*]<4>[29:42*]<2>[39:2*]<-2>[36:2*]<2>[15:23]<3>[11:34*]<4>[71:4*]<-4>[B,78:4*]
This chain enforced A<>4 or B<>4, Since A=B, therefore A=r9c9<>4 => r7c8=8.
Using short hand notation:
[A,78:4]-[99:4]=[29:42]=[39:2]-[36:2]=[15:23]=[11:34]=[71:4]-[B,78:4]
=> A=B<>4 => r9c9<>4 => r7c8=8.
Using general forcing chain notation:
r9c9=4 => r7c8<>4
r9c9=1 => r2c9=4 => r3c9=2 => r3c6<>2 => r1c5=2 => r1c1=3 => r7c1=4 => r7c8<>4
Therefore r7c8<>4 => r7c8=8.
I don't know whether this chain has been identified by other solvers. Although the construction of the graph is quite tedious, the chain is nevertheless eventually identifiable within human ability.