Due: Sunday 13 November by 10:59pm Worth: 8%

Size: px

Start display at page:

Download "Due: Sunday 13 November by 10:59pm Worth: 8%"

Amberlynn Neal
5 years ago
Views:

1 CSC 8 HF Project # General Instructions Fall Due: Sunday Novemer y :9pm Worth: 8% Sumitting your project You must hand in your work electronically, using the MarkUs system. Log in to using your UTORid. To sumit your work, again navigate to the Project page, then click on the Sumissions ta near the top. Click Add a New File and either type a file name or use the Browse utton to choose one. Then click Sumit. For this project, you must hand in just one file: gomoku.py You can sumit a new version of the file at any time (though the lateness penalty applies if you sumit after the deadline) look in the Replace column. For the purposes of determining the lateness penalty, the sumission time is considered to e the time of your latest sumission. Once you have sumitted, click on the file s name to check that you have sumitted the correct version. Rememer that the names of the files you sumit must e exactly as specified (and the case of the letters must e the same). If your file is not named exactly as specified, your code will receive zero for correctness. The if name == "main" lock All your testing code should e inside the if name == "main" lock. You must not use gloal variales in this project. Clarifications and discussion oard Important clarifications and/or corrections to the project, should there e any, will e posted on the CSC8HF Piazza. You are responsile for monitoring the announcements there. Hints & tips Start early. Programming projects always take more time than you estimate! Do not wait until the last minute to sumit your code. You can overwrite previous sumissions with more recent ones, so sumit early and often a good rule of thum is to sumit every time you get one more feature implemented and tested. Write your code incrementally. Don t try to write everything at once, and then compile it. That strategy never works. Start off with something small that compiles, and then add functions to it gradually, making sure that it compiles every step of the way. Read these instructions and make sure you understand them thoroughly efore you start ask questions if anything is unclear! Inspect your code efore sumitting it. Also, make sure that you sumit the correct file. Seek help when you get stuck! Check the discussion oard first to see if your question has already een asked and answered. Ask your question on the discussion oard if it hasn t een asked already. Talk to your TA during the la if you are having difficulties with programming. Go to the instructors office hours if you need extra help with understanding the course content. At the same time, eware not to post anything that might give away any part of your solution this would constitute plagiarism, and the consequences would e unpleasant for everyone involved! If you Engineering Science, University of Toronto Page of

2 CSC 8 HF Project # General Instructions Fall cannot think of a way to ask your question without giving away part of your solution, then please drop y office hours or ask y private Piazza message instead. If your message to the TA or the instructor is Here is my program. What s wrong with it?, don t expect an answer! We expect you to at least make an effort to start to deug your own code, a skill which you are meant to learn as part of this course. And as you will discover for yourself, reading through someone else s code is a difficult process we just don t have the time to read through and understand even a fraction of everyone s code in detail. However, if you show us the work that you ve done to narrow down the prolem to a specific section of the code, why you think it doesn t work, and what you ve tried to fix it, it will e much easier to provide you with the specific help you require and we will e happy to do so. How you will e marked We will mark your project for the correctness of the functions that you are required to write. Make sure that you follow the specifications exactly. Correctness We will run your functions using a Python interpreter. Please ensure that you are running Python as well. To check what version of Python you are running, you can run the following in your Python shell: import sys sys.version Syntax errors in your code will cause you to lose most of the marks for this project. Note that your functions must e implemented precisely according to the project specifications. Their signatures should e exactly as in the project handout, and their ehaviour should e exactly as specified. In particular, make sure that functions do not print anything unless the project specifications specifically demand that, and that the functions return exactly what the project handout is asking for. Engineering Science, University of Toronto Page of

3 CSC 8 HF Project # AI For the Game of Gomoku Fall The Gomoku Game In this assignment you will implement a simple (and imperfect) AI engine for the game Gomoku, played on a 8 8 oard. In Gomoku, there are two players. One player plays with lack stones and the other player plays with white stones. A player moves y placing a stone on an empty square on the oard. The player who plays with lack stones always moves first. After the first move, the players alternate. A player wins if she has placed five of her stones in a sequence, either horizontally, or vertically, or diagonally. Please read for more information aout Gomoku. We will e playing the standard variant. The starter code The file gomoku.py contains the starter code for the Gomoku game and AI engine. The program works as follows. The computer (which plays with the lack stones) always moves first. After the first move, the user s and the computer s moves alternate. The computer determines its move y finding the move that maximises the return value of the score function (which is provided). Functions in gomoku.py accepts oard as one of its arguments. This is the representation of the Gomoku oard. The square (y,x) on the oard is stored in oard[y][x]. The value of the square is: " ", if the square is empty, "", if the square has a lack stone on it, and "w", if the square has a white stone on it. See the function printboard for an example of using oard. An important part of the Gomoku AI engine is finding contiguous sequences of stones of the same colour on the Gomoku oard. There are four possile directions for a sequence: left-to-right, top-to-ottom, upper-left-to-lower-right, and upper-right-to-lower-left. Note that we do not consider, for example, the direction right-lo-left, since a right-to-left sequence can e represented as a left-to-right sequence. The direction of a sequence can e represented y a pair of numers (d_y, d_x) as follows: (,): direction left-to-right. For example, the sequence of stones of the same colour on coordinates (,), (,), (,), (,) is a sequence in direction left-to-right. Note that we say that the last stone in the sequence is at location (,), not at location (,). (,): direction top-to-ottom. For example, a sequence of stones of the same colour on coordinates (,), (,), (,) is a top-to-ottom sequence. Note that we say that the last stone in the sequence is at location (,), not at location (,). (,): direction upper-left-to-lower-right. For example, a sequence of stones of the same colour on coordinates (,), (,), (,) is an upper-left-to-lower-right sequence. Note that we say that the last stone in the sequence is at location (,), not at location (,). (,-): direction upper-right-to-lower-left. For example, a sequence of stones of the same colour on coordinates (,), (,), (,) is an upper-right-to-lower-left sequence. Note that we say that the last stone in the sequence is at location (,), not at location (,). A sequence can e: open: a stone can e put on a square at either side of the sequence. Engineering Science, University of Toronto Page of

4 CSC 8 HF Project # AI For the Game of Gomoku Fall w w w w w w w w w w w w Figure : (,) Figure : (,) Figure : (,) Figure : (,) Figure : (,-) closed: the sequence is locked on oth sides, so that no stone can e placed on either side of the sequence. This can occur either ecause the sequence egins/ends near the order of the oard, or ecause there is a stone of a different colour in the location immediately next to the eginning/end of the sequence. semi-open: the sequence is neither open nor closed. Here are some examples of sequences and their classifications. Figure : An open sequence with white stones. The direction is (,). The last stone is at location (,). Figure : A semi-open sequence with lack stones. The direction is (,). The last stone is at location (,). Figure : A closed sequence with white stones. The direction is (,). The last stone is at location (,). Figure : A closed sequence with lack stones. The direction is (,). The last stone is at location (,). Figure : A semi-open sequence with white stones. The direction is (,-). The last stone is at location (,). The file gomoku.py contains implementations of the following functions: print_oard(oard) This function prints out the Gomoku oard. score(oard) This function computes and returns the score for the position of the oard. It assumes that lack has just moved. play_gomoku(oard_size) This function allows the user to play against a computer on a oard of size oard size oard size. This function interacts with the AI engine y calling the function searchmax(), which you will write. put_seq_on_oard(oard, y, x, d_y, d_x, length, col) This helper function adds the sequence of stones of colour col of length length to oard, starting at location (y,x) and moving in the direction (d_y, d_x). This function facilitates the testing of the AI engine. analysis(oard): This function analyses the position of the oard y computing the numer of open and semi-open sequences of oth colours. Do not modify these functions! Engineering Science, University of Toronto Page of

5 CSC 8 HF Project # AI For the Game of Gomoku Fall Part. The AI engine Write an AI engine for the Gomoku game y implementing the following functions. is_empty(oard) This function returns True iff there are no stones on the oard oard. is_ounded(oard, y_end, x_end, length, d_y, d_x) This function analyses the sequence of length length that ends at location (y end, x end). The function returns "OPEN" if the sequence is open, "SEMIOPEN" if the sequence if semi-open, and "CLOSED" if the sequence is closed. Assume that the sequence is complete (i.e., you are not just given a susequence) and valid, and contains stones of only one colour. detect row(oard, col, y start, x start, length, d y, d x) This function analyses the row (let s call it R) of squares that starts at the location (y start,x start) and goes in the direction (d y,d x). Note that this use of the word row is different from a row in a tale. Here the word row means a sequence of squares, which are adjacent either horizontally, or vertically, or diagonally. The function returns a tuple whose first element is the numer of open sequences of colour col of length length in the row R, and whose second element is the numer of semi-open sequences of colour col of length length in the row R. Assume that (y start,x start) is located on the edge of the oard. Only complete sequences count. For example, column in Fig. is considered to contain one open row of length, and no other rows. Assume length is an integer greater or equal to. detect rows(oard, col, length) This function analyses the oard oard. The function returns a tuple, whose first element is the numer of open sequences of colour col of length lengthon the entire oard, and whose second element is the numer of semi-open sequences of colour col of length length on the entire oard. Only complete sequences count. For example, Fig. is considered to contain one open row of length, and no other rows. Assume length is an integer greater or equal to. search max(oard): This function uses the function score() (provided) to find the optimal move for lack. It finds the location (y,x), such that (y,x) is empty and putting a lack stone on (y,x) maximizes the score of the oard as calculated y score(). The function returns a tuple (y, x) such that putting a lack stone in coordinates (y, x) maximizes the potential score (if there are several such tuples, you can return any one of them). After the function returns, the contents of oard must remain the same. is win(oard) This function determines the current status of the game, and returns one of ["White won", "Black won", "Draw", "Continue playing"], depending on the current status on the oard. The only situation where "Draw" is returned is when oard is full. Part. Play the game and think aout how you could improve the AI engine for the class contest. There is no need to sumit anything for this part yet. Engineering Science, University of Toronto Page of

Taffy Tangle. cpsc 231 assignment #5. Due Dates

Taffy Tangle. cpsc 231 assignment #5. Due Dates cpsc 231 assignment #5 Taffy Tangle If you ve ever played casual games on your mobile device, or even on the internet through your browser, chances are that you ve spent some time with a match three game.