Description
Objective:
– Read names from two different files into your program and write each name to a single new file.
– Download the namelist1.txt and namelist2.txt input files from the assignment page in Canvas and place them in the same folder as your program.
– Input files:
– nameslist1.txt
– nameslist2.txt
– Each file contains a list of 200 unique names.
– Output file:
– Output all names to an output file called allnames.txt
– Write a program that reads the names from the two input files and writes the names to the two output files.
Steps:
a. Ask the user to input the file name and path of the first input file.
– Use a try/except block to open all input before processing.
– If the file cannot be opened, display the appropriate error message, and require the user to reenter the file name and path.
– Continue looping until the user has entered a valid file name and path.
b. Ask the user to input the file name and path of the second input file.
– Use a try/except block to open all input before processing.
– If the file cannot be opened, display the appropriate error message, and require the user to reenter the file name and path.
– Continue looping until the user has entered a valid file name and path.
c. Ask the user to input the file name and path of the output file.
– Use a try/except block to open all input before processing.
– If the file cannot be opened, display the appropriate error message, and require the user to reenter the file name and path.
– Continue looping until the user has entered a valid file name and path.
d. Processing:
– Use a try/except block to read from the input files and write to the output file.
– Read all the names from one input file at a time. Write the names to the output file.
– You must use a while loop to process the first input file (nameslist1.txt) and write to the output file.
– You must use a for loop to process the second input file (nameslist2.txt) and write to the output file.
– Each line in each input file is one name.
– Each name must be written on a separate line in the output file.
– There must be no blank lines between names in the output files.
e. Close all input files and the output file after all names have been processed.
Rubric: The rubric is located on the assignment page in Canvas. Please review the rubric to make sure you meet all of the requirements for this lab.
Screen Shot:
Enter the path and name of the first file: c:test Terr.txt
Error: file(s) not found, or could not be opened. Please reenter.
Enter the path and name of the first file: c:testnameslist.1.t.t.
Enter the path and name of the second file: c:testerr.txt
Error: file(s) not found, or could not be opened. Please reenter.
Enter the path and name of the second file: c:testnameslist2.txt
Enter the path and name of the output file: c:testallnames.txt
Names processing started
Names processing complete
![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)
![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)
Lacretia White –
Excellent job, my friend. Thank You!!
Wanda Mckinley –
Tutor wrote it quickly and effectively. Great solution.
John Ayad –
It was quality work and in a timely manner. It was the help I needed at the time, and I appreciate it so very much.