🎉 Celebrating 25 Years of GameDev.net! 🎉

Not many can claim 25 years on the Internet! Join us in celebrating this milestone. Learn more about our history, and thank you for being a part of our community!

Back to Artificial Intelligence

basic ai without tree structure (min-max)

Peter Yeaney · 2011-09-27T22:28:12

I wrote a simple tic-tac-toe game. Although not practical, I use a picturebox for each game 'space' that can be occupied. When clicked, it changes to the appropriate 'x' or 'o' image and setting the tag to the 'owner' or player. I have been able to determine the winner by comparing the tags in correct orders... I'm now trying to implement the most basic of ai's, using 2 checks and a fallback: If ai can win, ai owns that space Else If player can win, ai owns that space Else choose random space from non owned spaces However, I would normally just start coding it and "if'ng" every single possible combination inside each of those checks (resulting in way too many nested if's and repeating if's, etc)... I'm wondering how might be a good way to go about this process? I was thinking of something like this, but as you can see it can soon get out of hand...: //check for win for 1 to 9 // 9 spaces if spacei has 'o' //owned by ai if i = 1 //check +1,+2,+3,+4,+6,+8 if spacei+1 has 'o' //owned by ai spacei+2 = 'o' //ai win next //check for blocking //pick random

Artificial Intelligence Programming

Started by detlion1643 September 14, 2011 06:43 PM

10 comments, last by AlanMcCormick 12 years, 10 months ago

detlion1643

Author

285

September 15, 2011 03:30 AM

[color=#1C2837][size=2]You don't have to hardcode the control names into the array based version. It's just board[x][y] versus BoardControl3.Tag and BoardControl4.Tag and.... [/quote]

That sounds a lot better suited code wise in reading and writing...

alvaro - Thanks for the examples, will prove helpful in re-fining the logic I'm going through!

AlanMcCormick

100

September 27, 2011 10:28 PM

If you are interested, I have a Tic Tac Toe game I made for a friend a while back written in .NET. It also has a computer player with several levels of difficulty and uses a negamax search to find the best moves. I would be glad to send the source code to you. I made it for a friend who was trying to learn C#.

🎉 Celebrating 25 Years of GameDev.net! 🎉

basic ai without tree structure (min-max)

This topic is closed to new replies.

Popular Topics

Recommended Tutorials

🎉 Celebrating 25 Years of GameDev.net! 🎉

basic ai without tree structure (min-max)

This topic is closed to new replies.

Popular Topics

Recommended Tutorials

Reticulating splines