def test_minmax_strategy_go_for_draw():
noughts = 137
crosses = 368
move = _minmax(noughts, crosses, False, False, 0)[1]
assert move == 4
def test_minmax_strategy_win_downstream():
noughts = 17
crosses = 132
move = _minmax(noughts, crosses, True, True, 0)[1]
assert move == 256
def test_minmax_strategy_block_crosses2():
noughts = 9
crosses = 336
move = _minmax(noughts, crosses, False, False, 0)[1]
assert move == 2
def test_minmax_strategy_block_crosses():
noughts = 272
crosses = 9
move = _minmax(noughts, crosses, False, False, 0)[1]
assert move == 64
def test_minmax_strategy_block_noughts():
noughts = 9
crosses = 272
move = _minmax(noughts, crosses, True, True, 0)[1]
assert move == 64
def test_minmax_strategy_empty_board():
noughts = 0
crosses = 0
move = _minmax(noughts, crosses, True, True, 0)[1]
assert move == 1
def test_minmax_strategy_noughts_wins():
noughts = 288
crosses = 25
move = _minmax(noughts, crosses, False, False, 0)[1]
assert move == 4