<div><p>Rules of the Game The game of tactego is set up on a board which is a 2d grid of size length x width which will be specified at the start of the game. The pieces will be specified in a file, which will have lines indicating the strength of the piece and the number of pieces with that strength. Players alternate by taking turns. A player selects a piece and then moves that piece. The position the player selects must be one of their pieces, you must test for this. The position that you select as the destination must be at most one place away up, down, left, right, or diagonally from the original position. The position must not contain one of the player's own pieces. If the destination contains an enemy's piece, then combat ensues. Flags cannot move. Combat is determined by strength. If a higher strength piece attacks a lower or equal strength piece then it wins. If a lower strength piece attacks a higher strength piece, then it loses. If any piece (that can move) attacks a flag, then it captures that flag. The winner of the combat takes the position that the piece was moving into. Victory for a player is when the other player has lost all of their flags. Design Details and Flow This is a specification for how the project should be implemented. Get the size of the board. Get the filename with the pieces. Create the board and the pieces, and place them onto the board randomly as specified here: Use the random.shuffle method on the pieces inputted from the file in order to randomize placement of the pieces. If you have a pieces list you can simply do random.shuffle(pieces) once, for each set of pieces. For the red player, place them at the top of the board, starting at position (0, 0) and going to (0, width - 1) then go to the next line (1, 0) and scan across the row. Keep going in that fashion until all of the pieces have been placed. For the blue player, place them on the bottom of the board starting at (length - 1, 0) going up to (length - 1, width - 1) before resetting to (length - 2, 0) and scanning across that row. Keep going until all pieces have been placed. The reason we're specifying this so carefully is so that we can all use a seed and generate the same placements of pieces. It will help both you and the graders to be able to test. Enter the main game loop. Stay in the game loop until one of the players wins. Draw the board. Get the player's move. A starting position should have two coordinates separated by a space. Check that the starting position is valid, return to (a) if not. Then get the ending position also two coordinates separated by a space. Check if the ending position is valid, return to ( c ) if not. Move the piece. Determine the result of any combat Return to (4) until there is a winning player. Report the player who won and end the game. Implementation Requirements You must have a main function called tactego: def tactego(pieces_file, length, width): You must import random in order to use shuffle. Your main block should be: if __name__ == '__main__': random.seed(input('What is seed? ')) file_name = input('What is the filename for the pieces? ') length = int(input('What is the length? ')) width = int(input('What is the width? ')) tactego(file_name, length, width) This will ensure that we can all have the same placement of pieces with different random seeds, which determines the output of the shuffles. Other than tactego, you should implement at least 4 additional functions. Keep in mind that my solution has approximately 8 functions, so you shouldn't be afraid to create far more than 5 total. You won't be rewarded for smashing too much functionality into each function so think about what the job of each function is and try to have it do that one job. The only global variables that you have should be constants (and technically the inputs in main at the beginning of the program that you send into the tactego function). The game board, pieces, and all of the other things that you create for this project should be local to the tactego function. This will force you to pass them as parameters to the functions that need that data. Load the pieces from the file in the order that they are given there, don't sort them or do anything before you run the shuffle on them. Run shuffle twice, once on the red pieces then once on the blue pieces in that order. Output the board at least once per turn so that the player can see what they're doing. Ask for the starting and ending positions in separate input statements, so that we can maintain consistency for testing.The pieces file format will be like this, each line will take one of these forms: [piece strength] [number of pieces] for example 7 3 means that there are 3 pieces with strength 7. F [number of flags] for instance F 1 or F 2 [there is a space between them] Extra Credit: M [number of mines] Extra Credit: S [number of sappers] Extra Credit: A [number of assassins] </p></div>

What three assumptions were the basis of von Thünen's theory? A. Proximity to other cities, variety in land characteristics, various modes of transportation available B. Isolation from other cities, economic stability, homogenous land characteristics C. Isolation from other cities, temperate climate, various modes of transportation D. Proximity to other cities, tropical climate, variety of land characteristics E. Isolation from other cities, homogenous land characteristics, limited methods of transportation

Which of the following statements is correct? Multiple Choice LIFO results in the same net income as FIFO when costs are rising. O FIFO results in a lower net income than LIFO when costs are rising. LIFO results in a higher net income than FIFO when costs are rising, C LIFO results in a higher net income than FIFO when costs are falling.

Stratego: The object of the game is to capture the flag or capture/defeat all your opponent's pieces. Rank Piece No. per player Special properties B Bomb 6 Defeats any piece except Miner 1 Marshal 1 Can be defeated by the Spy N General 1 3 Colonel 2 4 Major 3 5 Captain 4. 6 Lieutenant 4 7 Sergeant 4 Miner 5 Can defuse bombs 8 9 Scout 8 S Spy 1 Can defeat the General or Marshal F Flag 1 Its capture ends the game Please create a Python program simulating a game of Stratego • Program must include Object/Class that creates the game pieces • Game will randomly generate 2 pieces (Player-1 vs. Player-2), winner of play determined by chart above (think the card game "War") • Although pieces are randomly generated, game should respect the odds/ratio of getting a particular piece • Game ends when one player captures the flag of their opponent

Problem 3 - AB Equality Create a recursive function in a file called ab_equality.py: def ab equalín, k, current) Print out all of the strings of a's and b's of length n so that the number of a's and b's are equal. For n = 2, there's ab and ba. For n = 3 there are no strings since they'd have to have 2 a's and lb, or 2 b's a la so not equal. For n = 4, there will be 6 of these strings, and for n = 5, zero again. Hint: use k to track the difference between a's and b's. So for instance if your current is aaabb then k should be equal to either 1 or -1 (your choice depending). When you call the function, you should call it from your main or testing function with the length in the n parameter, O should be put into the k parameter, and then an empty string will be passed in for current. What length do you want to run? 4 aabb abab abba baab baba bbaa linux5[110] % python3 ab_equality.py What length do you want to run? 6 aaabbb aababb aabbab aabbba abaabb ababab ababba abbaab abbaba abbbaa baaabb baabab baabba babaab bababa babbaa bbaaab bbaaba bbabaa bbbaaa