Answered step by step
Verified Expert Solution
Question
1 Approved Answer
please provide a code for this task which is in accordance with my code in the stated chegg webpage the entire code : please provide
please provide a code for this task which is in accordance with my code in the stated chegg webpage
the entire code :
please provide a code that will produce the expected output when added to my code. I've not received an appropriate answer the last 2 times. I hope this time it will be successful this is the code I have developed for is_legal for now
the further info on legal positions is as follows
4. In the Board class, define a method is_legal(self) that returns True if the position on the board is legal and False otherwise (see Background Information for the definition of a legal position). Test Cases: I19 = load_board("I19.txt") print(I19) print(I19.is_legal()) I19.set_colour("E19", "E") print(I19.is_legal()) I19.set_colour("M9", "B") print(I19.is_legal()) print(I19) Expected output: ABCDEFGHIJKLMNOPQRS19....@@@.00..@.00 0.018@00@0@..@0@0...@@.@17@0..@0.000 00.00000@16..@@.00.@..0@0.@.0.150.@.@. 0@.00@@0..0@0140..000@.@@...@.0@@13. @0@..@..000.@.@..12..@@.@@@...@0.0...@ 11@0@.@@@0..@000@010@..0.@@0@00@ @.@.0@.9@00o..@0..@@0@@@.008@@0@.0 00.@.0@.@@@.@7@.0.0@00.00.@0@..@o6@ .10@@00@.@@.0.0.500@@..0@@.@.@.0@@ 0.4@.0..00.@0@0@00.@@.3@@00@.0.@.0@. @0@0..2..00@@0.@0.0.@00@.1@@.@0.@@. .@ 0 False True ABCDEFGHIJKLMNOPQRS19....@@.00..@@.00o .018@00@0@..@0@0...@@.@17@0...@0.0000 0.00000@16..@@.00.@..0@0.@.0.150.@.@.0 @.00@@0..0@0140..000@.@@...@.0@@13... @0@..@..000.@.@..12..@@.@@@..@@0.0...@ 11@0.@.@@@@0..@000@010@..0.@@0@00@ @.@.0@.9@000..@0..@@@@@@.008@@0@.0 00.@.0@.@@@.@7@.0.0@00.00.@0@..@06@ ..0@@00@.@@..0.0.500@@..0@@.@.@.0@@ 0.4@.0.00.@0@0@00.@@.3@@00@.0.@.0@. @0@0..2..00@@0.@0.0.@00@.1@@.@0.@@. .@00000 0 @@ Please refer My exercise is to create a Go game in python this... Chegg.com as it will give you my code as this is the 2nd part def is_legal(self): \# Iterate over the points on the board for i in range(self,size): for j in range(self,size): \# Skip empty points if self,board[i][j] ==".": continue \# Check the surrounding points for any illegal positions for dr, dc in ((1,0),(1,0),(0,1),(0,1)) : new_r =1+dr new_c =j+dc \# If the new point is out of bounds or empty, or if it has a different color than the current point, the position is illegal if not ( new_r \& self.size and new_c \& self.size) or self.board[new_r][new_c] == "." or self.board[new_r][new_c] != self.board[i][j]: return False return True Legal Positions A legal position is a position in which every point coloured black or white reaches mpty. The example above is not a legal position because there are points coloured white that don't reach empty. (Can you see how we had to fiddle with the image because Go software wouldn't let us create an illegal position ;-)?) It is a consequence of the rules that every valid move creates a legal position. This is because according to rule \#7, both colours are cleared, removing any stones that don't reach empty. Fun fact: the total number of legal positions on a 1919 Go board is about 2.0816810170. The exact number was computed by John Trump in 2016
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started