Finding the optimal strategy requires the investigation of pretty much all (pretty much, in the grand scale of things) the positions that are possible to get to from the start.
While developing a computer program that plays extremely well in chess (or other similar games) is a solvable task—actually, it is a solved task somewhere in the beginning of the XXI century—finding and proving an optimal strategy is a totally different problem. Chess is hard to fully analyze because of the large number of possible positions.
To go more formal, consider Shannon number
10^120 which is a lower-bound on the game-tree complexity of chess. It is true that the sensible games would go much lower to around
10^40, but it will not matter too much.
For the game variant you describe, one has to find the Shannon-like number to say about the feasibility of finding the optimal strategy. However, simply by looking at the rules, I doubt it would result in something that is feasible.
Thus, I don't expect an optimal playing strategy for this variant to be found any time soon. While it might be slightly easier than for regular chess, the complexity will still be enormous.
NB: Antichess example is different because of the introduction of the compulsory capture, which severely reduces the number of possible variations.