246 reputation
14
bio website
location
age
visits member for 2 years, 7 months
seen Feb 2 '13 at 0:34

Sep
16
comment Negamax implementation doesn't appear to work with tic-tac-toe
Assuming I understand your approach, what do you get if you print out all the negamax scores for each available move? Does (0,1) show the best score? Which move should the algorithm make first? What score does it get? Sharing your debug output would be useful.
Sep
16
comment Negamax implementation doesn't appear to work with tic-tac-toe
What happens after your code reads the last '_' in a row? I would expect a carriage return/line feed test in there. Just by looking, I would expect it to mess up your board array. Not necessarily related to your question, but still possibly a problem.
Sep
16
comment Negamax implementation doesn't appear to work with tic-tac-toe
Code comments would really help those who would like to help you without first learning the negamax algorithm and running your code locally.
Apr
13
comment Change Game Icon
It looks like that's the way it's done.