Recause you can rotate a tile, two tiles match if the number on the left or right matches the left or right on the other tile. For example, the domino 211 maches the domino 113 without rotating either, and 21 matches 213 after flipping the first domino. You should print all matches. First check a direct match, then try rotating tiles. But don't flip a tile whose left and right numbers are the same. If there is no match, print "No match". Don't restructure the code. Fill in a condition for each of the if... : statements.
Recause you can rotate a tile, two tiles match if the number on the left or right matches the left or right on the other tile. For example, the domino 211 maches the domino 113 without rotating either, and 21 matches 213 after flipping the first domino. You should print all matches. First check a direct match, then try rotating tiles. But don't flip a tile whose left and right numbers are the same. If there is no match, print "No match". Don't restructure the code. Fill in a condition for each of the if... : statements.
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
Python
![**. 5. In this program, you will check whether two dominoes match.
Because you can rotate a tile, two tiles match if the number on the left or right matches the left or right on the other tile. For example, the domino 2|1 maches the domino 113 without rotating either, and 2|1
matches 213 after flipping the first domino.
You should print all matches. First check a direct match, then try rotating tiles. But don't flip a tile whose left and right numbers are the same. If there is no match, print "No match".
Don't restructure the code. Fill in a condition for each of the if. .. : statements.
dominoes.py
1
2 print("First donino.')
3 left1 = int(input ("left value: "))
4 rightl = int(input("right value: "))
6 print("Second donino.")
7 left2 = int(input{"left value: "))
8 right2 = int(input ("right value: "))
10 natched = False
11 flipl = left1 !e right1
12 flip2 = left2 ! right2
13 if...
print{"Natch without flipping')
natched = True
14
15
16 if... :
17
print("Natch after flipping first domino")
natched - True
18
19 if... !
20
print("Natch after flipping second domino')
natched = True
21
22 if... :
23
24
print ("Natch after flipping both dominos")
natched = True
25 if... :
26
print("No natch")
Cocle:Check
Reset](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fb5cd7008-c1e2-4a94-af0d-074990eef3b0%2F7203485a-4836-4cc8-a409-63e5f12927b1%2Fvut4q9g_processed.jpeg&w=3840&q=75)
Transcribed Image Text:**. 5. In this program, you will check whether two dominoes match.
Because you can rotate a tile, two tiles match if the number on the left or right matches the left or right on the other tile. For example, the domino 2|1 maches the domino 113 without rotating either, and 2|1
matches 213 after flipping the first domino.
You should print all matches. First check a direct match, then try rotating tiles. But don't flip a tile whose left and right numbers are the same. If there is no match, print "No match".
Don't restructure the code. Fill in a condition for each of the if. .. : statements.
dominoes.py
1
2 print("First donino.')
3 left1 = int(input ("left value: "))
4 rightl = int(input("right value: "))
6 print("Second donino.")
7 left2 = int(input{"left value: "))
8 right2 = int(input ("right value: "))
10 natched = False
11 flipl = left1 !e right1
12 flip2 = left2 ! right2
13 if...
print{"Natch without flipping')
natched = True
14
15
16 if... :
17
print("Natch after flipping first domino")
natched - True
18
19 if... !
20
print("Natch after flipping second domino')
natched = True
21
22 if... :
23
24
print ("Natch after flipping both dominos")
natched = True
25 if... :
26
print("No natch")
Cocle:Check
Reset
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 2 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Recommended textbooks for you
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
![Computer Organization and Design MIPS Edition, Fi…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
![Network+ Guide to Networks (MindTap Course List)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
![Computer Organization and Design MIPS Edition, Fi…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
![Network+ Guide to Networks (MindTap Course List)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
![Concepts of Database Management](https://www.bartleby.com/isbn_cover_images/9781337093422/9781337093422_smallCoverImage.gif)
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
![Prelude to Programming](https://www.bartleby.com/isbn_cover_images/9780133750423/9780133750423_smallCoverImage.jpg)
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
![Sc Business Data Communications and Networking, T…](https://www.bartleby.com/isbn_cover_images/9781119368830/9781119368830_smallCoverImage.gif)
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY