How to implement a linear conflict heuristic check for tags in C++?

Question

C++ / C#

They set a big lab, the program must solve tags, and not necessarily to the correct state a from any state A to any state B.
One of the steps is to use heuristics to calculate how far the current state of the matrix is ​​far from the desired one.
I have been trying to implement such a check for a week now. Its essence is as follows:
It is considered that domino I and domino J are in linear conflict along the line if they both are in their line, but domino I is to the left of domino J, although in fact it should be to the right. Also with columns.
I just can't figure out how to check it "machine".
Tell me, please, someone.