*This looks like a minimax problem but it is not! * What you might want to do is to explore the game tree until you reach m moves and say:

1. When it's white's turn, result is YES if at least one move is winning.
2. When it's black's turn, result is YES if all moves cannot prevent a white win if we continue