Is there a universal algorithm for the problems 'Is it possible to shift 1 matchstick so that the equality becomes true'?

Question

Python

Good evening. The task is:
An expression is given. For example: 9 = 6 (from matches)
Is it possible to get the correct expression by shifting one list?
How to do it programmatically?

Answer 1

How to do it programmatically?

Find all possible positions in which to put the match. Find all admissible figures from matches. Print the value of each valid shape and each combination of valid shapes. Go through all the matches, shift each match into all possible positions, check if all the formed figures and their combination are admissible and calculate the value of the resulting expression. Sounds simple, doesn't it?