3.4. Placing a Stone at a Specific IntersectionNow we want to replicate placing a stone on the board. Your task is to write a functionplace_on_board(board, stone, position) which:● Takes the following parameters:○ A board○ A stone value (either "●" or "○")○ A position (a tuple of strings (a, b) where a is the row index, e.g., “0”, and b isthe column index, e.g., “A”)● If the move is successfully performed, return a boolean value of True● If the move is impossible (e.g., invalid or occupied position), return a boolean valueof False

def create_board(size): size = int(size) board = [[' '] * size for i in range(size)] return boarddef is_occupied(board, x, y): if x >= 0 and y >= 0 and board[x][y] != ' ': return True else: return False def place_on_board(board, stone, position): x = int(input('Please enter row line: ')) y = ord(input('Please enter column line: ')) if is_occupied(board, x, y): return False else: board[x][y] = stone return Trueboard = create_board(3)stone = "●"position = (1,2)place_on_board(board, stone, position)

def check_available_moves(board): available_moves = [] size = len(board) for row in range(size): # iterate go through rows for co in range(size): # iterate through column for each row if board[row][co] == ' ': #check the positoin is occupied or not available_moves.append(row, chr(co + 65)) return available_moves # return the available movesboard = create_board(9)print_board(board)check_available_moves(board)

Write a function called display_board(board) which accepts a list of strings representing a Connect Four board. The function should print the board in the following format:The first string in the board list represents the bottom row of the board and subsequent strings represent higher rows, with the last string in the list representing the top row.Each row should be printed with a vertical bar "|" before the first column and after the last column, signifying the edges of the board.Each location in the board (initially represented by ".") is separated from adjacent locations by a space.No space is used between the location and the edge of the board.Below the contents of the board is a row of hyphen characters "-" signifying the bottom of the board. This row is surrounded by vertical bars "|"A single character corresponding to the label of each column appears below the corresponding column.  This row is surrounded by vertical bars "|"Each column is labelled with a single digit starting at 0 in the left column and increasing consecutively towards the right column.Notes:You can assume that the create_board(width, height) and get_width(board) functions are defined within CodeRunner for this question.  However, if you submit these yourself in the answer then the tests will still work correctly (if they meet the requirements specified in earlier questions).For example:Test Resultdisplay_board(['....', '....', '....', '....'])|. . . .||. . . .||. . . .||. . . .||-------||0 1 2 3|board = create_board(9, 7)display_board(board)|. . . . . . . . .||. . . . . . . . .||. . . . . . . . .||. . . . . . . . .||. . . . . . . . .||. . . . . . . . .||. . . . . . . . .||-----------------||0 1 2 3 4 5 6 7 8|

Write a function called create_board(width, height) which returns a list containing strings that represent the rows in a Connect Four board.The number of strings (i.e., the number of rows) is equal to the height, or a minimum of 4 if the value of height is less than 4, and a maximum of 10 if the value of height is greater than 10.The length of each string (i.e., the number of columns) is equal to the width, or a minimum of 4 if the value of width is less than 4, and a maximum of 10 if the value of width is greater than 10.Each string uses the "." character to represent each empty location.For example:Test Resultb = create_board(0, 0)print(b)['....', '....', '....', '....']b = create_board(6, 7)print(b)['......', '......', '......', '......', '......', '......', '......']

We are given a two-dimensional board of size N × M (N rows and M columns). Each field of the board can be empty ('.'), may contain an obstacle ('X') or may have a character in it. The character might be either an assassin ('A') or a guard. Each guard stands still and looks straight ahead, in the direction they are facing.Every guard looks in one of four directions (up, down, left or right on the board) and is represented by one of four symbols. A guard denoted by '<' is looking to the left; by '>', to the right; '^', up; or 'v', down. The guards can see everything in a straight line in the direction in which they are facing, as far as the first obstacle ('X' or any other guard) or the edge of the board.The assassin can move from the current field to any other empty field with a shared edge. The assassin cannot move onto fields containing obstacles or enemies.Write a function:bool solution(vector<string> &B);that, given an array B consisting of N strings denoting rows of the array, returns true if is it possible for the assassin to sneak from their current location to the bottom-right cell of the board undetected, and false otherwise.Examples:1. Given B = ["X.....>", "..v..X.", ".>..X..", "A......"], your function should return false. All available paths lead through a field observed by a guard.2. Given B = ["...Xv", "AX..^", ".XX.."], your function should return true. The guard in the second row is blocking the other one from watching the bottom-right square.3. Given B = ["...", ">.A"], your function should return false, as the assassin gets spotted right at the start.4. Given B = ["A.v", ..."], your function should return false. It's not possible for the assassin to enter the bottom-right cell undetected, as the cell is observed.Write an efficient algorithm for the following assumptions:N is an integer within the range [1..500];all strings in B are of the same length M from range [1..500];there is exactly one assassin on the board;there is no guard or wall on B[N−1][M−1];every string in B consists only of the following characters '.', 'X', '<', '>', 'v', '^' and/or 'A'.