🕸Fergus Duniho wrote on Tue, Aug 22, 2017 01:55 PM UTC:
A Sissa can make a legal move only if there is a space on the board, #x, from which the expression "and or and checkride origin #x 1 0 checkride #x dest 1 1 and checkride origin #x 1 1 checkride #x dest 1 0 == distance origin #x distance dest #x" is true. This might also be expressed in a way that allows for breaking from the expression when the truth value is known, such as "checkride origin #x 1 0 and checkride #x dest 1 1 or and checkride origin #x 1 1 checkride #x dest 1 0 and == distance origin #x distance dest #x". The brute force way would be to check every space on the board until a true value is found or all the spaces have been checked out. The smarter way would be to do some calculations to reduce the number of spaces that need to be checked. Additionally, the mathematical relation between origin and dest could be checked to make sure a Sissa move is even possible.
A Sissa can make a legal move only if there is a space on the board, #x, from which the expression "and or and checkride origin #x 1 0 checkride #x dest 1 1 and checkride origin #x 1 1 checkride #x dest 1 0 == distance origin #x distance dest #x" is true. This might also be expressed in a way that allows for breaking from the expression when the truth value is known, such as "checkride origin #x 1 0 and checkride #x dest 1 1 or and checkride origin #x 1 1 checkride #x dest 1 0 and == distance origin #x distance dest #x". The brute force way would be to check every space on the board until a true value is found or all the spaces have been checked out. The smarter way would be to do some calculations to reduce the number of spaces that need to be checked. Additionally, the mathematical relation between origin and dest could be checked to make sure a Sissa move is even possible.