Optimal way to win at Damath
A partial answer: since Damath is a two-player game of complete information and no randomness, Zermelo's Theorem says that one of the following is true:


There is a dominant strategy for 1st player. 
There is a dominant strategy for 2nd player. 
There are strategies for both players that guarantee they don't lose, i.e. perfect play results in a draw (like Tic-Tac-Toe).


As far as I can tell, no one has yet determined which of these three is true. Checkers (aka Draughts or Dama, the game Damath is based on) was 'solved' in 2007 with the aid of computers: two perfect players will always draw. Thus I would assume that modern computers are powerful enough to 'solve' Damath as well, but I don't know what the result would be.