Non-Recursive tic-tac-toe AI Algorithm

CS

I intend to lay out the algorithm for a function that returns the next cell to be occupied by an AI in a game of Tic-tac-toe (iteratively). The AI’s difficulty can be divided into 3 levels: easy, medium and difficult.

View original post 1,200 more words

Advertisements

About Khuram Ali

Programming... Programming and Programming...!!!

Posted on April 27, 2013, in Algorithms, Artificial Intelligence and tagged , . Bookmark the permalink. Leave a comment.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

%d bloggers like this: