Consider the following game:

Two players get dealt a number between 0 and 1, lowest number wins at showdown

Pot of 1

stacks of s behind

N streets

Players can check, or bet and raise for any size they like on every street.

Has anyone solved this game? Would it be possible to solve it numerically (In terms of computation time)?