I'm currently working on a minimax implementation for a game of checkers in C#. The minimax itself works fine if you ignore a few bugs I've yet to fix, but I'm having some problems finding a way I can properly create lists of 'Chain' moves, or moves with multiple jumps.
I've made several attempts at building a function which would take an attacking move and run it through some recursion to find all the possible branches, but so far the main result is that no attack move at all has been working.
Anyhow I'd appreciate some pointers on how to go about generating all the attack moves that could follow as a result of an attack. I'm guessing some form of recursion is going to be necessary at the very least.