You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
The package uses minimax1 to determine the best move, however, the implementation is flawed, reporting only three states (OUTCOME_HUMAN_WINS, OUTCOME_MACHINE_WINS, or OUTCOME_DRAW), resulting on very bad moves which result on always playing the leftmost column.
This update would most likely only require a new method that's called inside the remaining == 0 conditions, replacing OUTCOME_DRAW with a call to the new method that evaluates the score heuristically.
The package uses minimax1 to determine the best move, however, the implementation is flawed, reporting only three states (
OUTCOME_HUMAN_WINS
,OUTCOME_MACHINE_WINS
, orOUTCOME_DRAW
), resulting on very bad moves which result on always playing the leftmost column.This update would most likely only require a new method that's called inside the
remaining == 0
conditions, replacingOUTCOME_DRAW
with a call to the new method that evaluates the score heuristically.Footnotes
https://en.wikipedia.org/wiki/Minimax ↩
The text was updated successfully, but these errors were encountered: