Has loser chess been solved? Loser chess has a benefit of sorts. There are many turns where moves are forced. So my question is, has it been solved? I'd say that the move tree is much smaller than chess. If not:


How much would it weight? Have there been any studies on the number of moves?
How much time would it take? The number of positions will probably be much less than normal, so the time should be much less. 
Are there any ongoing projects?
Professor Mark Watkins announced he had found the solution to Losing Chess in October 2016. Regardless of what Black plays, White can force a win beginning with 1. e3.