Blshops on a blnge def safe_squares_bishops (n, bishops): A generalized n-by-n chessboard has been taken over by some bishops, each represented as a tuple (row, column) of the row and the column of the square the bishop stands on. Same as in the earlier version of this problem with rampaging rooks, the rows and columns are numbered from 0 to n - 1. Unlike a chess rook whose moves are axis-aligned, a chess bishop covers all squares that are on the same diagonal with that bishop arbitrarily far into any of the four diagonal compass directions. Given the board size n and the list of bishops on that board, count the number of safe squares that are not covered by any bishop. To determine whether two squares (rl, cl) and (r2, c2) are reachable from each other in one diagonal move, use abs (rl-r2) -- abs (cl-c2) to check whether the horizontal distance between those squares equals their vertical distance, which is both necessary and sufficient for the squares to lie on the same diagonal. This way you don't need to write the essentially identical block of logic separately four times, but a single test can handle all four diagonals in one swoop. Expected result n bishops 10 100 4 [ (2, 3), (0, 1)] 11 8 [ (1, 1), (3, 5), (7, 0), (7, 6)] 29 2 [(1, 1)] 2 6 [ (0, 0), (1, 1), (2, 2), (3, 3), (4, 4), (5, 5)] 18 100 [(row, (row*row) 8 100) for row in range (100) ] 6666
Blshops on a blnge def safe_squares_bishops (n, bishops): A generalized n-by-n chessboard has been taken over by some bishops, each represented as a tuple (row, column) of the row and the column of the square the bishop stands on. Same as in the earlier version of this problem with rampaging rooks, the rows and columns are numbered from 0 to n - 1. Unlike a chess rook whose moves are axis-aligned, a chess bishop covers all squares that are on the same diagonal with that bishop arbitrarily far into any of the four diagonal compass directions. Given the board size n and the list of bishops on that board, count the number of safe squares that are not covered by any bishop. To determine whether two squares (rl, cl) and (r2, c2) are reachable from each other in one diagonal move, use abs (rl-r2) -- abs (cl-c2) to check whether the horizontal distance between those squares equals their vertical distance, which is both necessary and sufficient for the squares to lie on the same diagonal. This way you don't need to write the essentially identical block of logic separately four times, but a single test can handle all four diagonals in one swoop. Expected result n bishops 10 100 4 [ (2, 3), (0, 1)] 11 8 [ (1, 1), (3, 5), (7, 0), (7, 6)] 29 2 [(1, 1)] 2 6 [ (0, 0), (1, 1), (2, 2), (3, 3), (4, 4), (5, 5)] 18 100 [(row, (row*row) 8 100) for row in range (100) ] 6666
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
100%
please help with the python problem, thank you
![Blshops on a blnge
def safe_squares_bishops (n, bishops):
A generalized n-by-n chessboard has been taken over by some bishops, each represented as a tuple
(row, column) of the row and the column of the square the bishop stands on. Same as in the
earlier version of this problem with rampaging rooks, the rows and columns are numbered from 0
to n - 1. Unlike a chess rook whose moves are axis-aligned, a chess bishop covers all squares that
are on the same diagonal with that bishop arbitrarily far into any of the four diagonal compass
directions. Given the board size n and the list of bishops on that board, count the number of safe
squares that are not covered by any bishop.
To determine whether two squares (rl, cl) and (r2, c2) are reachable from each other in
one diagonal move, use abs (rl-r2)
between those squares equals their vertical distance, which is both necessary and sufficient for the
squares to lie on the same diagonal. This way you don't need to write the essentially identical block
of logic separately four times, but a single test can handle all four diagonals in one swoop.
== abs(cl-c2) to check whether the horizontal distance
Expected
result
bishops
n
10
[]
100
4
[ (2, 3), (0, 1)]
11
[(1, 1), (3, 5), (7, 0), (7, 6)]
29
[ (1, 1)]
6.
[ (0, 0), (1, 1), (2, 2), (3, 3), (4, 4), (5, 5)] 18
100
[(row, (row*row) 8 100) for row in range (100)]
6666](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F0f4c3b8d-420b-4827-8129-a9e5c9a665e1%2F448c681c-aad4-406f-bed2-ba199f435422%2Faaj9s7f_processed.png&w=3840&q=75)
Transcribed Image Text:Blshops on a blnge
def safe_squares_bishops (n, bishops):
A generalized n-by-n chessboard has been taken over by some bishops, each represented as a tuple
(row, column) of the row and the column of the square the bishop stands on. Same as in the
earlier version of this problem with rampaging rooks, the rows and columns are numbered from 0
to n - 1. Unlike a chess rook whose moves are axis-aligned, a chess bishop covers all squares that
are on the same diagonal with that bishop arbitrarily far into any of the four diagonal compass
directions. Given the board size n and the list of bishops on that board, count the number of safe
squares that are not covered by any bishop.
To determine whether two squares (rl, cl) and (r2, c2) are reachable from each other in
one diagonal move, use abs (rl-r2)
between those squares equals their vertical distance, which is both necessary and sufficient for the
squares to lie on the same diagonal. This way you don't need to write the essentially identical block
of logic separately four times, but a single test can handle all four diagonals in one swoop.
== abs(cl-c2) to check whether the horizontal distance
Expected
result
bishops
n
10
[]
100
4
[ (2, 3), (0, 1)]
11
[(1, 1), (3, 5), (7, 0), (7, 6)]
29
[ (1, 1)]
6.
[ (0, 0), (1, 1), (2, 2), (3, 3), (4, 4), (5, 5)] 18
100
[(row, (row*row) 8 100) for row in range (100)]
6666
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps with 1 images
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education