[Tutor] Todays Learning Python Question From a Newbie ;)

[Alan Gauld]

Bob,

>> Write a new computer_move() function for the tic-tac-toe game to plug 
>> the hole in the computers stratergy. See if you can create an opponent 
>> that is unbeatable!
>>
>> My main problem is that I can not see how the computers stratergy can 
>> be improved as at best I can only manage a tie with the computer!

Does the computer ever go first? 
Does the computer start with a random location?
If yes to the above then the computer can be beaten since the entire 
course of a Tic-Tac-Toe game (or OXO as we call it in the UK!)
depends upon the first move location.

If no to the above then, provided the gameplay is OK, I don't know 
what the author means either.

Alan G.