07-05-2021, 04:22 AM
I am working on a game(s) in which one must capture a specific (or in some versions, at least a specific) number of enemy pieces in a series of adjacent non-repeated steps from a chosen starting location in order to complete the turn.
Perhaps it could be done as a filter used for each decision step of the capture like (max ... ) <requirement>
Since I also need piece chain moves in other games for flipping selected chains of pieces between two chosen end-points, then having minimum and maximum chain-distance functions (ie min and max non-crossing/non-overlapping series of steps) could be a way to approach both needs.
This is also similar to asking the length of the shortest and longest paths to a destination in a maze without retracing.
Do you already have any suitable methods?
Perhaps it could be done as a filter used for each decision step of the capture like (max ... ) <requirement>
Since I also need piece chain moves in other games for flipping selected chains of pieces between two chosen end-points, then having minimum and maximum chain-distance functions (ie min and max non-crossing/non-overlapping series of steps) could be a way to approach both needs.
This is also similar to asking the length of the shortest and longest paths to a destination in a maze without retracing.
Do you already have any suitable methods?