go game in python -- 2

The theme of this test is the game of go. The goal is to write a function that determines whether the stone at an x, y position on a goban is taken or not. Vocabulary: Goban: the board on which stones are placed to play Shape: a group of one or more adjacent stones of the same color (adjacent: stones that are left, right, top, bottom of each other, diagonals do not count) Freedom: empty space adjacent to a shape Reminder of the rules: The goban has an indefinite size There are two players and everyone plays a stone color: black or white The stones are laid one after the other each turn When a form has no more freedom it is taken The objective of the test is to write an is_taken function which takes in parameter x, y and which returns true if the stone with the position x, is taken there and false otherwise. To do this function we use a function get_status (x, y) which returns: [login to view URL]: when the stone at position x, y is black [login to view URL]: when the stone at the x position, y is white [login to view URL]: when there is no stone at position x, y [login to view URL]: when the position x, y is out of the goban Complete the Goban.is_taken method with your solution (you can add parameters to the method if needed). This one must respect the good practices of Python. You can test your solution at any time with [login to view URL] (the tests are in the file [login to view URL]). Examples: # = black o = white . = empty . #. # o # <= o is taken because she has no freedom, she has no adjacent empty space . #. ... # o # <= o is not taken because she has a freedom over . #. o # <= o is taken because she has no freedom (the top and the left are out of the goban so they are not freedoms) #. oo. ## o <= the form # is taken because it has no freedom o o # .o. oo. ##. <= the form # is not taken because it has a freedom in x = 2, y = 1 (0, 0 on the top left) o o # .o.