Here is simplified chess engine II problem solution - https://programs.programmingoneonone.com/2021/07/hackerrank-simplified-chess-engine-II-problem-solution.html

I hate the lack of specification of certain things: 1) If moves is "3", does that mean "white move, black move, white move" or "after three moves by white"? 2) "Regardless of how black plays", does that mean "you must be guaranteed to win, no matter what black does on its moves" or "you're free to force black to move stupidly, and as long as there's a way to win, you win"?

how to slove the problem .. may i know .....

I easily solved the "Simplified Chess Engine (without II)" problem. But my Python solution of this problem does not pass all tests due to timeout because of g = 1000. I tried alpha-beta pruning with sorting of moves (taking pieces first). Then I tried hashing positions and checking if they had been encountered before. All without great success. I think the problem can be easily solved without using any heuristics on any сompiled language. But when using slow languages this problem is not such easy.

I also recommend solving the "Simple Chess Engine" problem (without the "II") before attempting this one. In that one, we had to implement queens, bishops, rooks, and knights, e.g. everything except pawns. That took me about 8-9 hours, then after solving that, I passed this problem in about 1 hour with a few small modifications to support pawns.