For the Grasses-planting problem, there are THREE squares that the farmer robot can be located and three possible actions Move Left (L), Move Right (R) and Plant- grass (P). Move Left (Right) in the Left-Most (Right-Most) square will stay in the same square. A Square can be either "with grasses" or "empty". The objective of the farmer robot is to plant grasses on all the squares. An example state that the farmer robot located at the LEFT square and there are grasses on both the CENTER and the RIGHT squares is given as below: (a) Compute the number of all possible states for this problem. (b) Give an Action Sequence such that the agent is able to complete the task if the initial state is the same as the given example above.

For the Grasses-planting problem, there are THREE squares that the farmer robot can be located and three possible actions Move Left (L), Move Right (R) and Plant- grass (P). Move Left (Right) in the Left-Most (Right-Most) square will stay in the same square. A Square can be either "with grasses" or "empty". The objective of the farmer robot is to plant grasses on all the squares. An example state that the farmer robot located at the LEFT square and there are grasses on both the CENTER and the RIGHT squares is given as below: (a) Compute the number of all possible states for this problem. (b) Give an Action Sequence such that the agent is able to complete the task if the initial state is the same as the given example above.

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

See similar textbooks

Similar questions

agents: An agent is trying to eat all the food in a maze that contains obstacles, but he now has the help of his friends! An agent cannot occupy a square that has an obstacle. There are initially k pieces of food (represented by dots), at positions (f1,...,fk). There are also n agents at positions (p1,...,pn). Initially, all agents start at random locations in the maze. Consider a search problem in which all agents move simultaneously ;that is, in each step each agent moves into some adjacent position (N, S, E, or W, or STOP). Note that any number of agents may occupy the same position. Figure 1: A maze with 3 agents For each of the following heuristics, indicate (yes/no) whether or not it is h1: The number of dots (representing food) remaining. [ True, False ]. h2(s)=0, where s is a state node. [ True, False ]. h3(s)=1, where s is a state node. [ True, False ].
Imagine a robot sitting on the upper left corner of grid with r rows and c columns.The robot can only move in two directions, right and down, but certain cells are "off limits" such that the robaot cannot step on them. Design an algorithm to find a path for the robot from the top left to the bottom right.
Complete the task using the return search algorithm: Task: The labyrinth is represented by a Boolean square matrix A8x8. The cell (i, j) is considered passable if the element ai, j is true and otherwise impassable. Write a program that checks if there is a path from adjacent horizontally and vertically passable cells of the maze, which starts in its upper left corner (0.0) and ends in its lower right corner (7.7). Operating instructions: 1) Compose a Boolean function Path (i, j), called with initial parameters (0,0); 2) If cell (i, j) is outside the matrix Path returns false; 3) If cell (i, j) coincides with (7,7) a path is found and Path returns true; 4) If cell (i, j) is impassable Path returns false (because it cannot exit the cell), otherwise (if the cell is passable) there is a path from it to cell (7,7), if there is a path from any of the cells adjacent to (i, j) next to cell (7,7). Adjacent cells per cell (i, j) are cells (i + 1, j), (i, j + 1), (i-1, j), (i, j-1).
Q. Given a 2d grid map of '1's (land) and '0's (water),count the number of islands.An island is surrounded by water and is formed byconnecting adjacent lands horizontally or vertically.You may assume all four edges of the grid are all surrounded by water. Example 1: 11110110101100000000Answer: 1 Example 2: 11000110000010000011Answer: 3""" def num_islands(grid): count = 0 for i in range(len(grid)): for j, col in enumerate(grid[i]): if col == 1: dfs(grid, i, j) count += 1 Please code it. .
Determine the value of the decision parameter for the circle drawing technique described by Bresenham on page. Bresenham's method for drawing circles is shown here in a stage-by-stage format.
An edge labeled with multiple symbols a, b,... → edge labeled with the symbol. Select one: True False Given regular expressions R1 and R2, then... Select one: ( KE a. R1+R2 is a regular expression b. R1R2 is a regular expression c. R1 is a regular expression d. All of the above
G E N E T I C - A L G O R I T H M OBJECT REWARD WEIGHT A 20 1 B 5 2 C 10 3 D 40 8 E 15 7 F 25 4 G 4 5 H 7 2 Here, Maximum weight = 12 The above problem is a 0/1 Knapsack problem. You have to carry the different objects in your bag in a way such that the reward is maximized without exceeding the weight limit. You can carry an object exactly once but you always have to carry the object labeled “H”. Encode the problem and create an initial population of 4 different chromosomes. Explain what would be an appropriate fitness function for this problem. Use the fitness function and perform natural selection to choose the 2 fittest chromosomes. Using the selected chromosomes perform a single point crossover to get 2 offspring. Perform mutation and check the fitness of the final offspring. Explain your work.
Determine the value of the decision parameter for the circle drawing technique described by Bresenham on page. Bresenham's method for drawing circles is shown here in a stage-by-stage format.
In programming, we use the mask concept to indicate information that can be shown to the user and information that must be “masked”, that is, hidden. In an implementation of a hangman game, we use a mask to indicate which secret word positions the player has already guessed right (whose the contents must therefore be shown to the player), and which positions must remain hidden. Each time that the player hits a letter of the hidden word, the mask is updated so that it has little dashes in the places of letters that the player has not hit yet and show it, in their proper place, the letters that he already hit it. For example, if the word is "cards", the current mask is: - a - - s and the player guesses the letter "d", the mask should be updated to: - a - ds.Write a function called update_mask that takes as input a string containing the word secret (in the example above, this word would be “cards”), a list whose elements are the characters of the current mask (in the example above…
A group of m people is considering sharing the cost of buying some items for their summer camp. There are a total of n possible items to purchase. Each person writes a list of the items they are interested in purchasing on a paper. For example, person one may write “boat, trampoline, hot tub,” whereas person two may write “ hot tub, kayak, paddleboard”. There is no limit to how many items a person registers on their sheet. The goal is to determine if at least k items can be purchased. The following rules apply 1. The cost of any purchased item must be split equally among all those who listed that item on their sheet. No person can refuse to contribute to an item chosen for purchase, which is listed on their sheet. 2. Since each person has a limited budget, they may only contribute to at most one item on their list. The problem of determining if at least k items can be purchased is called SummerCamp. Show that this problem is NP-complete.
Create a bar graph for the 3 students whom grades for each question can be seen in the table. the title of graph must be named , (size of font: 12) x axis must be ‘Questions’ y axis must show ‘Grades’ , (rotate: 0º) solve by using MATLAB program