 It is thus theoretically possible to " solve " chess , determining with certainty whether a perfectly played game should end in a win for White , a draw , or even a win for Black . However , according to Shannon the time frame required puts this possibility beyond the limits of any feasible technology . 
 It <a href='drop_aux' title='1'><mark>is</mark></a>thus theoretically possible to " solve " chess , determining with certainty whether a perfectly played game should end in a win for White , a draw , or even a win for Black . However , according to Shannon the time frame<a href='been_done' title='2'><mark></mark></a> required puts this possibility beyond the limits of any feasible technology . 
It thus theoretically possible to " solve " chess , determining with certainty whether a perfectly played game should end in a win fir White , a draw , or even a win for Black . However , according to Shannon da time frame been required puts dis possibility beyond the limits of any feasible technology .