![]() |
Capture a chain (adjacent sequence) of N enemy stones, if possible - Printable Version +- Ludii Forum (https://ludii.games/forums) +-- Forum: Suggestions (https://ludii.games/forums/forumdisplay.php?fid=10) +--- Forum: Ludii Features / Services (https://ludii.games/forums/forumdisplay.php?fid=11) +--- Thread: Capture a chain (adjacent sequence) of N enemy stones, if possible (/showthread.php?tid=631) |
Capture a chain (adjacent sequence) of N enemy stones, if possible - dale walton - 07-05-2021 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? |