5 def solveMaze ( maze ) : 6 # Creating a 5 *5 2-D list sol = [ [ 0 for j in range (5) ] for i in range (5) ] 7. 8. 9. if solveMazeUtil (maze, 0, 0, sol) == False: 1 print ("Solution doesn't exist"); return False 4 printSolution (sol) return True 7 # A recursive utility function to solve Maze problem 8 def solveMazeUtil (maze, x, y, sol) : # if (x, y is goal) return True if x == N - 1 and y == N - 1 and maze[x] [y] == 1: 1 2 sol [x] [y] = 1 return True 4 # Check if maze [x] [y] is valid if isSafe (maze, x, y) == True: # Check if the current block is already part of solution path. if sol[x] [y] = 1: 7
5 def solveMaze ( maze ) : 6 # Creating a 5 *5 2-D list sol = [ [ 0 for j in range (5) ] for i in range (5) ] 7. 8. 9. if solveMazeUtil (maze, 0, 0, sol) == False: 1 print ("Solution doesn't exist"); return False 4 printSolution (sol) return True 7 # A recursive utility function to solve Maze problem 8 def solveMazeUtil (maze, x, y, sol) : # if (x, y is goal) return True if x == N - 1 and y == N - 1 and maze[x] [y] == 1: 1 2 sol [x] [y] = 1 return True 4 # Check if maze [x] [y] is valid if isSafe (maze, x, y) == True: # Check if the current block is already part of solution path. if sol[x] [y] = 1: 7
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
How this python code will look like in C++
![25 def solveMaze ( maze ):
26
# Creating a 5 *
sol = [ [ 0 for j in range (5) ] for i in range (5) ]
27
5 2-D list
28
29
30
if solveMazeUtil (maze, 0, 0, sol)
== False:
31
print ("Solution doesn't exist");
32
return False
33
34
printSolution (sol)
35
return True
36
37 # A recursive utility function to solve Maze problem
38 def solveMazeUtil (maze, x, y, sol) :
39
# if (x, y is goal) return True
if x == N - 1 and y == N - 1 and maze [x] [y] == 1:
40
41
42
sol[x] [y]
= 1
43
return True
44
45
46
# Check if maze [x] [y] is valid
if isSafe (maze, x, y)
True:
# Check if the current block is already part of solution path.
if sol [x] [y] == 1:
47
48
49
return False](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fc58ef99a-5d4d-4c89-a3e3-1caee88d6933%2F3c4c0c16-34e1-499a-b229-d6c3755d424b%2Fn07pjy_processed.jpeg&w=3840&q=75)
Transcribed Image Text:25 def solveMaze ( maze ):
26
# Creating a 5 *
sol = [ [ 0 for j in range (5) ] for i in range (5) ]
27
5 2-D list
28
29
30
if solveMazeUtil (maze, 0, 0, sol)
== False:
31
print ("Solution doesn't exist");
32
return False
33
34
printSolution (sol)
35
return True
36
37 # A recursive utility function to solve Maze problem
38 def solveMazeUtil (maze, x, y, sol) :
39
# if (x, y is goal) return True
if x == N - 1 and y == N - 1 and maze [x] [y] == 1:
40
41
42
sol[x] [y]
= 1
43
return True
44
45
46
# Check if maze [x] [y] is valid
if isSafe (maze, x, y)
True:
# Check if the current block is already part of solution path.
if sol [x] [y] == 1:
47
48
49
return False
![1 # Python3 program to solve Rat in a Maze
2 # problem using Recursion
3
4 # Maze size
5 N = 5
6.
7 # A utility function to print solution matrix sol
8 def printSolution ( sol ):
9.
10
for i in sol:
11
for j in i:
12
print (str(j) + " "
end ="")
13
print ("")
14
15 # A utility function to check if x, y is valid
16 # index for N * N Maze
17 def isSafe ( maze, x, y ) :
18
19
if x >= 0 and x < N and y >= 0 and y <N and maze[x] [y]
1:
==
20
return True
21
22
return False
23
24](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fc58ef99a-5d4d-4c89-a3e3-1caee88d6933%2F3c4c0c16-34e1-499a-b229-d6c3755d424b%2Fyar7uyi_processed.jpeg&w=3840&q=75)
Transcribed Image Text:1 # Python3 program to solve Rat in a Maze
2 # problem using Recursion
3
4 # Maze size
5 N = 5
6.
7 # A utility function to print solution matrix sol
8 def printSolution ( sol ):
9.
10
for i in sol:
11
for j in i:
12
print (str(j) + " "
end ="")
13
print ("")
14
15 # A utility function to check if x, y is valid
16 # index for N * N Maze
17 def isSafe ( maze, x, y ) :
18
19
if x >= 0 and x < N and y >= 0 and y <N and maze[x] [y]
1:
==
20
return True
21
22
return False
23
24
Expert Solution
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
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