1. Terms
By accessing the website at https://gotit-pro.com, you are agreeing to be bound by these terms of service, all applicable laws and regulations, and agree that you are responsible for compliance with any applicable local laws. If you do not agree with any of these terms, you are prohibited from using or accessing this site. The materials contained in this website are protected by applicable copyright and trademark law.
2. Use License
- Permission is granted to temporarily download one copy of the materials (information or software) on “Gotit Pro’s” website for personal, non-commercial transitory viewing only. This is the grant of a license, not a transfer of title, and under this license you may not:
- modify or copy the materials;
- use the materials for any commercial purpose, or for any public display (commercial or non-commercial);
- attempt to decompile or reverse engineer any software contained on “Gotit Pro’s” website;
- remove any copyright or other proprietary notations from the materials; or
- transfer the materials to another person or “mirror” the materials on any other server.
- This license shall automatically terminate if you violate any of these restrictions and may be terminated by “Gotit Pro” at any time. Upon terminating your viewing of these materials or upon the termination of this license, you must destroy any downloaded materials in your possession whether in electronic or printed format.
3. Disclaimer
- The materials on “Gotit Pro’s” website are provided on an ‘as is’ basis. “Gotit Pro” makes no warranties, expressed or implied, and hereby disclaims and negates all other warranties including, without limitation, implied warranties or conditions of merchantability, fitness for a particular purpose, or non-infringement of intellectual property or other violation of rights.
- Further, “Gotit Pro” does not warrant or make any representations concerning the accuracy, likely results, or reliability of the use of the materials on its website or otherwise relating to such materials or on any sites linked to this site.
4. Limitations
In no event shall “Gotit Pro” or its suppliers be liable for any damages (including, without limitation, damages for loss of data or profit, or due to business interruption) arising out of the use or inability to use the materials on “Gotit Pro’s” website, even if “Gotit Pro’s” authorized representative has been notified orally or in writing of the possibility of such damage. Because some jurisdictions do not allow limitations on implied warranties, or limitations of liability for consequential or incidental damages, these limitations may not apply to you.
5. Accuracy of materials
The materials appearing on “Gotit Pro’s” website could include technical, typographical, or photographic errors. “Gotit Pro” does not warrant that any of the materials on its website are accurate, complete or current. “Gotit Pro” may make changes to the materials contained on its website at any time without notice. However “Gotit Pro” does not make any commitment to update the materials.
6. Links
“Gotit Pro” has not reviewed all of the sites linked to its website and is not responsible for the contents of any such linked site. The inclusion of any link does not imply endorsement by “Gotit Pro” of the site. Use of any such linked website is at the user’s own risk.
7. Modifications
“Gotit Pro” may revise these terms of service for its website at any time without notice. By using this website you are agreeing to be bound by the then current version of these terms of service.
8. Governing Law
These terms and conditions are governed by and construed in accordance with the laws of Florida and you irrevocably submit to the exclusive jurisdiction of the courts in that State or location.
![The University of Western Ontario Department of Computer Science London, Canada Software Tools and Systems Programming (Computer Science 2211A) LAB7 The week of October 22 - October 28, 2023 This lab is an exercise with pointer arithmetic. Question 2 of the lab exercise is taken from exercise 17 in Chapter 12 of our textbook: C Programming Language: A Modern Approach (Second Edition), by K. N. King. 1. Rewrite the following function to use pointer arithmetic instead of array subscripting. (In other words, eliminate the variables i and all of the [] operators.) Note that for any array a, the expression a[i] is equivalent to *(a+i). int sum_array(const int a[], int n) { int i, sum = 0; for (i = 0; i < n; i++) sum += a[i]; return sum; }](https://gotit-pro.com/wp-content/uploads/2023/10/c80fe157-523d-4b22-a16d-64c419fa011c.png)
![Your task is to implement in Python the following adversarial search algorithms (refer to lecture slides and/or your textbook for details | pseudocode provided below): MiniMax (as specified by the MINIMAX-SEARCH pseudocode below) When the game is complete, your program should display a corresponding message: X WON or O WON TIE X LOST or O LOST MiniMax with alpha-beta pruning (as specified by the ALPHA-BETA-SEARCH pseudocode below), and apply them to play the game of Tic-Tac-Toe (computer). Using any other approach is not going to be accepted. Problem input/command line interface: Your program should: Accept three (3) command line arguments, so your code could be executed with python cs480_P01_AXXXXXXXX.py ALGO FIRST MODE where: - cs480_P01_AXXXXXXXX.py is your python code file name, - ALGO specifies which algorithm the computer player will use: 1 - MiniMax, 2 - MiniMax with alpha-beta pruning, - FIRST specifies who begins the game: X When it is human player's turn, your program should display the following prompt: X's move. What is your move (possible moves at the moment are: | enter 0 to exit the game)? where: is a sorted list of all available moves at the moment, for example, if the board arrangement is: and it is X's move, the prompt should be: What is your move (possible moves at the moment are: 2, 3, 7, 9) | enter 0 to exit the game)? If the user enters anything other than 0/ valid move number (0 should terminate the game) your program should repeat the prompt above. Once the user enters a valid move, display the updated game board on screen. When it is the computer's turn (regardless of the game mode), your program should display (it could be an 'X' or 'O' move): X's selected move: Z. Number of search tree nodes generated: A.A.A where: - Z is the move/action number (a positive integer from the {1, 2, 3, 4, 5, 6, 7, 8, 9} set) selected by computer - A.A.A is the number of search tree nodes generated (the number of MiniMax nodes computer explored before making the decision [including "root"]) to select it. Follow it with the updated game board on screen. - NOTE!!! Computer's search tree move exploration order should be in a sorted fashion (1, 2, 3, 4, 5, 6, 7, 8, 9 | assuming HERE that ALL moves are available). 2 - computer (X) versus computer (O), Example: python cs480_P01_A11111111.py 2 X 1 If the number of arguments provided is NOT three (none, one, two or more than three) or arguments are invalid (incorrect ALGO, FIRST or MODE) your program should display the following error message: ERROR: Not enough/too many/illegal input arguments. and exit. Program details: Specific program details: The Tic-Tac-Toe game board is represented by 3x3 grid with cells numbered as follows - Possible moves/actions for both players match cell numbers (if a player wants to place an 'X' in the middle of the board, the move/action is '5'), Your program should begin by displaying the following information: Last Name, First Name, Axxxxxxxx solution: Algorithm: MiniMax with alpha-beta pruning First: X Mode: human versus computer where: - Axxxxxxxx is your IIT A number, - Algorithm is the algorithm specified by a command line argument, - First is the information who makes the first move as specified by a command line argument, - Mode is the game mode as specified by a command line argument, If the game mode is human versus computer display an empty board first and prompt the user to pick the move (see below)](https://gotit-pro.com/wp-content/uploads/2023/10/9a1b7061-c5a7-48b6-a744-6dc4634c6532.png)
Lacretia White –
Solution I got is great! Before deadline and is great with changes
Safir Adeni –
The assignments I submit are always of great quality and completed on time.
Kirsten Gorby –
Fantastic support for every assignment, every time. 5+ Stars!