#heuristic

Question 1: Single choice

A Connect Four agent scores each valid move by applying a heuristic to the board right after its own move, and plays the highest-scoring move (random among ties). The heuristic counts windows of four cells holding three of one player's discs and one empty cell. Why can this agent pick a move that lets the opponent win on the very next turn?

It ignores the opponent's reply, so a losing move can tie with a safe one1
The heuristic only counts horizontal windows, so diagonal threats stay invisible2
It chooses uniformly at random among all valid moves whenever no win is available3
It maximizes the opponent's score, because the heuristic subtracts the opponent's threes4

Timed test