SC_Homework1_Response - TheEvergreenStateCollege/upper-division-cs-23-24 GitHub Wiki
Link to original assignment
Check-off Questions
Consider the following questions for your checkoff.
Is there always a winning strategy? Under what conditions? If not, give a counterexample. If there is a winning strategy, how would you describe it in English?
There is no strategy that will always win. If the program goes first, and attempts to achieve a formation which would guarantee there would be one turn in which the program could set up 2 potential win states, forcing the opponent to block one but not the other, winning would be more likely.
Is there a way to express this strategy in pseudo-code?
while (! opponent.next_move().contains("potential_win_state")) {
current_board = get_board();
next_move = random_select_next_move(current_board);
do(next_move);
}