Simulate the working of chess with the below sample smaller game board. A player with any piece$/$coin standing where its opponent sacrifices all the piece$/$coin is a win for the first player.

Soldier$/$Pawn $($S$)$ can move only one straight step ahead. Only if opponent coins are available, it can move in diagonally one step forward to attack the opponent coin. Horses$/$Knight$($H$)$ can move either forward$/$backward in L$$shaped strides covering exactly $3$ tiles. It is the only piece that can jump over other coins