Problem 7 - A mouse wants to find cheese in a 5x5 grid. The cheese is in random place in the maze. The mouse can make one of the moves to right, left, up or down. It continues moving until it finds the cheese. Write a function that gets the initial location of the mouse [x,y] as input and helps the mouse find the cheese by telling in if it's making the correct move each time until it finds the cheese. You type in the mouse move every time and tell the mouse if it's getting closer to the cheese or farther from it.

Problem 7 - A mouse wants to find cheese in a 5x5 grid. The cheese is in random place in the maze. The mouse can make one of the moves to right, left, up or down. It continues moving until it finds the cheese. Write a function that gets the initial location of the mouse [x,y] as input and helps the mouse find the cheese by telling in if it's making the correct move each time until it finds the cheese. You type in the mouse move every time and tell the mouse if it's getting closer to the cheese or farther from it.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter15: Recursion

Section: Chapter Questions

Problem 6PE

See similar textbooks

Similar questions

Write a program that asks user to enter number of vertices in an undirected graph and then the adjacency matrix representing the undirected graph. The program, then, must display whether the given graph is connected or not.
Union-Find: Maze Write a program that generates mazes of arbitrary size using the union-find algorithm. A simple algorithm to generate the maze is to start by creating an N x M grid of cells separated by walls on all sides, except for entrance and exit. Then continually choose a wall randomly, and knock it down if the cells are not already connected to each other. If we repeat the process until the starting and ending cells are connected, we have a maze. It is better to continue knocking down the walls until every cell is reachable from every cell as this would generate more false leads in the maze. Test you algorithm by creating a 15 x 15 grid, and print all the walls that have been knocked down. D
Given an array of strings strs, group the anagrams together. You can return the answer in any order. An Anagram is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once. Example 1: Input: strs = ["eat","tea","tan","ate","nat","bat"] Output: [["bat"],["nat","tan"],["ate","eat","tea"]] Example 2: Input: strs = [""] Output: [[""]] Example 3: Input: strs = ["a"] Output: [["a"]] Constraints: 1 <= strs.length <= 104 0 <= strs[i].length <= 100 strs[i] consists of lowercase English letters.
Write a function below that will take a 2d array of booleans representing a map as a parameter which will construct a vgraph as a searchable graph. You many use go, python or java do to this.
Problem 4 We can use lists of numbers like l to represent a mathematical vector. Recall from math classes that a vector is an object with a magnitude and direction. The magnitude is the sqrt of the sum of the squares (for a vector (x,y) it's the Pythagorean theorem for the magnitude (x^2 + y^2)**(1/2)). For a vector of any other length, the formula generalizes to (l[0]^2 + l[1]^2 + l[2]^2 + ... )**(1/2). For this problem use l from Problem 1 and a for loop to compute the magnitude of l with the result stored in l_mag. For l above, its magnitude is 12.96. Python gives you the ** exponentiation operator to raise a number to a power. You could also import math and use math.sqrt(). l = [1, 2, 3, 4, 5, 7, 8] Please give proper explanation and typed answer only.
Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. For example, given n = 3, a solution set is: [ "((()))", "(()())", "(())()", "()(())", "()()()" ] """ def generate_parenthesis_v1(n): defadd_pair(res, s, left, right): ifleft==0andright==0: res.append(s) return ifright>0: add_pair(res, s+")", left, right-1) ifleft>0: add_pair(res, s+"(", left-1, right+1) res= [] add_pair(res, "", n, 0) returnres def generate_parenthesis_v2(n): defadd_pair(res, s, left, right): ifleft==0andright==0: res.append(s) ifleft>0: add_pair(res, s+"(", left-1, right) ifright>0andleft<right: add_pair(res, s+")", left, right-1).
A vector is given by x = [9 –1.5 13.4 13.3 –2.1 4.6 1.1 5 –6.1 10 0.2]. Using conditional statements and loops, write a program that rearranges the elements of x in order from the smallest to the largest. solve code in matlab
A robot starts on a point marked “A” on a rectangular grid of points. The starting point is always the top left point on the grid. The robot can move left, right, up or down, moving from one point to the next. By moving in steps going left, right, up or down, the robot would like to reach a point marked “B”, which is always the bottom right point in the grid. Sometimes, points are marked as “x”, and the robot is not allowed to visit them at all. A robot is never allowed to visit a point more than once. In how many ways can the robot move from A to B and visit all points along the way? For example, in the following grid, represented in text as A . . . . B there is only one path from A to B: In the following grid, represented in text as A . . x x B there is still only one path (we're lucky because of the two x's): However, in the grid A . . . x B there are no ways for the robot to move from A to B and visit all points that are not marked with “x”. Write a single…
Blackout Math is a math puzzle in which you are given an incorrect arithmetic equation. The goal of the puzzle is to remove two of the digits and/or operators in the equation so that the resulting equation is correct. For example, given the equation 6 - 5 = 15 ^ 4/2 we can remove the digit 5 and the / operator from the right-hand side in order to obtain the correct equality 6 - 5 = 1 ^ 42. Both sides of the equation now equal to 1. Observe how removing an operator between two numbers (4 and 2) causes the digits of the numbers to be concatenated (42). Here is a more complicated example: 288 / 24 x 6 = 18 x 13 x 8 We can remove digits and operators from either side of the equals sign (either both from one side, or one on each side). In this case, we can remove the 2 from the number 24 on the left-hand side and the 1 from the number 13 on the right-hand side to obtain the correct equality 288 / 4 x 6 = 18 x 3 x 8 Both sides of the equation now equal to 432. Here is another puzzle for you…
Write a RECURSIVE function, without using any loops, that prints the contents of a matrix with 3 columns. The function should take the matrix and the number of rows as arguments. void print_matrix(int arr[][3], int num_rows);
The third logical operator is OR(). This returns TRUE when any of its inputs is TRUE. For example, OR(FALSE, TRUE, FALSE) returns TRUE since the second input is TRUE, but OR(FALSE, FALSE, FALSE) returns FALSE since all its inputs are FALSE. In column H, find women who are white or have over 12 years of school In column I, find women who match the previous condition and get unemployment insurance benefits. In cell A28, define a filter to return only the rows that match conditions in column I. please show the excel solution of "is white or has over 12 years experience"and " is white or has over 12 years experience) and gets unemployment insurance benefits?",thank you :) Has young kids? Is head of household? Gets unemployment insurance benefits? Is white or has over 12 years experience? (Is white or has over 12 years experience) and gets unemployment insurance benefits? FALSE TRUE TRUE FALSE FALSE FALSE FALSE TRUE TRUE FALSE FALSE FALSE TRUE TRUE TRUE…
Under your module imports, paste the following definitions: (define WIDTH 300) (define HEIGHT 160) (define ES (empty-scene WIDTH HEIGHT)) (define (next-size s) (/ s 2)) Next, write a tail-call recursive function called circles. This function should take two numbers, x and size, and a Scene scn. If size is less-than or equal to 2, then your function returns the scn unchanged (base case). Otherwise, your function should place a circle in the Scene that results from a recursive call to circles with x shifted by (+ size (next-size size)), a new size of (next-size size), and using the original Scene. After evaluating (circles 100 48 ES), your function should output this image of five blue circles, in this order, with the first circle at (x,y) coordinate position (100, 80):