{"id":38219,"date":"2018-02-20T23:50:30","date_gmt":"2018-02-20T23:50:30","guid":{"rendered":"https:\/\/writemyessayfree.com\/simple-games-using-ai-c-assignment-4-simple-games-using-ai-i-description-in-this-project-you-will-develop-an-agent-that-proposes-the-next-possible-move-in-a-number-tic-tac-toe-game-using"},"modified":"2017-08-16T07:02:40","modified_gmt":"2017-08-16T07:02:40","slug":"simple-games-using-ai-c-assignment-4-simple-games-using-ai-i-description-in-this-project-you-will-develop-an-agent-that-proposes-the-next-possible-move-in-a-number-tic-tac-toe-game-using","status":"publish","type":"post","link":"https:\/\/www.benedictsol.com\/blogs\/simple-games-using-ai-c-assignment-4-simple-games-using-ai-i-description-in-this-project-you-will-develop-an-agent-that-proposes-the-next-possible-move-in-a-number-tic-tac-toe-game-using\/","title":{"rendered":"Simple Games using AI C++ Assignment 4: Simple Games using AI I. Description: In this project, you will develop an agent that proposes the next possible move in a Number TIC-TAC-TOE game using"},"content":{"rendered":"
\n

Simple Games using AI C++<\/p>\n

Assignment 4: Simple Games using AI I. Description: In this project, you will develop an agent that proposes the next possible move in a Number TIC-TAC-TOE game using
minimax adversarial search described in Week5. This game is a variation of the traditional Tic-Tac-Toe. One player uses the odd number between 1 to 9 and the other
player uses the even numbers between 2 to 8. The odd number player goes first. The winner is the player who completes a row of three numbers that add up to 15 (row
could be diagonal, horizontal or vertical). The output of the project will look similar as follows: You could assume that human takes the odd numbers while computer
takes the even numbers (range is from 1-9). First, you will need to display a table to start the game, you can use \u00c3\u00a2\u00e2\u201a\u00ac\u00c5\u201c-\u00c3\u00a2\u00e2\u201a\u00ac\u00c5\u201c and \u00c3\u00a2\u00e2\u201a\u00ac\u00c5\u201c|\u00c3\u00a2\u00e2\u201a\u00ac\u00c2\u009d to draw the table
in text mode: \u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2013 | | | | \u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2013 | | | |
\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2013 | | | | \u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2013 Then you will prompt the user to enter their move first.
Each move is described by a pair (x,y) with x being the index of row, and y being the index of columns. For simplicity purpose, we assume that x has values in [0,2]
and y has values in [0,2]. For example, the user enter: 0 1 The program redraws the table to reflect the user\u00c3\u00a2\u00e2\u201a\u00ac\u00e2\u201e\u00a2s move: an odd number is displayed in the node
corresponds to row 0 and column 1, as shown below: \u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2013 | | 3 | | \u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2013 | |
| | \u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2013 | | | | \u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2013 The program can sleep for a minute or so, then print
out the system\u00c3\u00a2\u00e2\u201a\u00ac\u00e2\u201e\u00a2s move based on the calculation of minimax algorithm that we learned in Week 5. The table can then be re-drawn as follows:
\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2013 | 6 | 3 | | \u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2013 | | | |
\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2014\u2013 | | | | (This move is just for illustrative purpose only) You will repeat the above steps until the game is over.
There are three outcomes for the game: Either: the user wins: Please print out the congratulations to the user The system wins: Please print out \u00c3\u00a2\u00e2\u201a\u00ac\u00c5\u201c You tried your
best. Thank you for playing\u00c3\u00a2\u00e2\u201a\u00ac\u00c2\u009d. Neither wins: Please print out \u00c3\u00a2\u00e2\u201a\u00ac\u00c5\u201cTie game. Thank you for playing\u00c3\u00a2\u00e2\u201a\u00ac\u00c2\u009d.<\/p>\n<\/div>\n","protected":false},"excerpt":{"rendered":"

Simple Games using AI C++ Assignment 4: Simple Games using AI I. Description: In this project, you will develop an agent that proposes the next possible move in a Number TIC-TAC-TOE game using minimax adversarial search described in Week5. This Read More …<\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[],"tags":[],"class_list":["post-38219","post","type-post","status-publish","format-standard","hentry"],"_links":{"self":[{"href":"https:\/\/www.benedictsol.com\/blogs\/wp-json\/wp\/v2\/posts\/38219","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.benedictsol.com\/blogs\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.benedictsol.com\/blogs\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.benedictsol.com\/blogs\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.benedictsol.com\/blogs\/wp-json\/wp\/v2\/comments?post=38219"}],"version-history":[{"count":0,"href":"https:\/\/www.benedictsol.com\/blogs\/wp-json\/wp\/v2\/posts\/38219\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.benedictsol.com\/blogs\/wp-json\/wp\/v2\/media?parent=38219"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.benedictsol.com\/blogs\/wp-json\/wp\/v2\/categories?post=38219"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.benedictsol.com\/blogs\/wp-json\/wp\/v2\/tags?post=38219"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}