As I indicated in private email yesterday to Jon, there is indeed a
hole in the computer stratey when the following three first moves are
made:
x:2
o:4 (first available "best move" for the computer)
x:7
I also sketched a "solution", which I will rephrase here in a different way.
The next "best m
All that does is reverse the hole!?!?x:2o:4x:7o:0x:80:5 O | | X - | O | O - | X | X On 02/02/06,
Wolfram Kraus <[EMAIL PROTECTED]> wrote:
Jon Moore wrote:[...]> Thanks to André, there is a way to win every time if you take the first> move (see below), so there
Jon Moore wrote:
[...]
> Thanks to André, there is a way to win every time if you take the first
> move (see below), so there MUST be a whole in the computers stratergy!
> Based on what we all know about the game, I would say that you can not
> make it so that the computer can win every time,
On 02/02/06, Alan Gauld <[EMAIL PROTECTED]> wrote:
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>>
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
Jon Moore wrote:
> Hi,
>
> Ok its the last exercise in the chapter of the python book (Python for
> the absolute beginner) I am working my way through.
>
> I have been learning about functions using a tic-tac-toe game as an
> example and I understand it fairly clearly, however the author says
>
Hi,Ok its the last exercise in the chapter of the python book (Python for the absolute beginner) I am working my way through.I have been learning about functions using a tic-tac-toe game as an example and I understand it fairly clearly, however the author says the following:
Write a new computer_mo
