Ask Question, Ask an Expert

+1-415-315-9853

info@mywordsolution.com

Ask Computer Engineering Expert

problem 1: n vehicles occupy squares (1, 1) through (n, 1) (i.e., the bottom row) of an n × n grid. The vehicles must be moved to the top row but in reverse order; so the vehicle i that starts in (i, 1) must end up in (n - i + 1, n). On each time step, every one of the n vehicles can move one square up, down, left, or right, or stay put; but if a vehicle stays put, one other adjacent vehicle (but not more than one) can hop over it. Two vehicles cannot occupy the same square.

a) find out the size of the state space as a function of n.

b) find out the branching factor as a function of n.

c) Suppose that vehicle i is at (xi, yi); prepare a nontrivial admissible heuristic hi for the number of moves it will require to get to its goal location (n - i + 1, n), assuming no other vehicles are on the grid. Give a formula for hi in terms of xi, yi, and n.

d) Which of the following heuristics are admissible for the problem of moving all n vehicles to their destinations? describe.

929_heuristics.jpg

problem 2: Describe the search algorithm that results from each of the following special cases. How does it relate to other algorithms we have discussed.

a) Local beam search with k = 1.

b) Local beam search with one initial state and no limit on the number of states retained.

c) Simulated annealing with T = 0 at all times (and omitting the termination test).

d) Simulated annealing with T = ∞ at all times.

e) Genetic algorithm with population size N = 1.

Computer Engineering, Engineering

  • Category:- Computer Engineering
  • Reference No.:- M91083

Have any Question? 


Related Questions in Computer Engineering

1 list and discuss three characteristics an application

1. List and discuss three characteristics an application must have in order to be considered suited for the cloud. 2. What is MapReduce? Describe the structure and working of MapReduce. 3. What is Hadoop? Describe the th ...

Adaptive unsharp masking a powerful method of sharpening

(Adaptive unsharp masking) A powerful method of sharpening images in the presence of low levels of noise (such as film grain noise) is via the following algorithm [15] . The high-pass filter which can be used for unsharp ...

1 a grab bag adt is similar to the bag adt with one

1. A Grab Bag ADT is similar to the Bag ADT with one difference. A grab bag does not have a remove() operation, but in place of it has a grabItem() operation, which allows for the random removal of an item from the bag. ...

Part 1find a recent article or video describing the

Part 1 Find a recent article or video describing the competition between two or more businesses. And describe in 2-5 sentences on the following: 1 The competing businesses and they sell 2 Which company you believe is win ...

Questions1 explain the principle of Questions: 1. Explain the principle of

Questions: 1. Explain the principle of convention-over-configuration. 2. Why does a template's file name have the .html.erb extension? 3. What must be placed in an application's controller class? 4. What kinds of operati ...

1 compare and contrast distance-vector and link-state

1. Compare and contrast distance-vector and link-state routing. If you were designing a new routing protocol, which would you use and why? 2. Analyze the routing table on your computer. In Windows you can view it with a ...

1 assume a destination computer receives several packets

1. Assume a destination computer receives several packets from a source. How can it be sure that the fragments belonging to a datagram are not mixed with the fragments belonging to another datagram? 2. Explain why the In ...

Computer science assignmentanswer the questions clearly

Computer Science Assignment Answer the questions clearly, explain your answer, and show your work. Answers, even if right but without an explanation, will get no credit. The explanations need to be brief, but complete, l ...

In this assignment you will model the game of bulgarian

In this assignment, you will model the game of Bulgarian Solitaire. The game starts with 45 cards. (They need not be playing cards. Unmarked index cards work just as well.) Randomly divide them into some number of piles ...

1 write findmin and findmax methods for the avltree class2

1. Write FindMin and FindMax methods for the AVLTree class. 2. Using the Timing class, compare the times for the methods implemented in Exercise 1 to the same methods in the BinarySearchTree class. Your test program shou ...

  • 4,153,160 Questions Asked
  • 13,132 Experts
  • 2,558,936 Questions Answered

Ask Experts for help!!

Looking for Assignment Help?

Start excelling in your Courses, Get help with Assignment

Write us your full requirement for evaluation and you will receive response within 20 minutes turnaround time.

Ask Now Help with Problems, Get a Best Answer

Section onea in an atwood machine suppose two objects of

SECTION ONE (a) In an Atwood Machine, suppose two objects of unequal mass are hung vertically over a frictionless

Part 1you work in hr for a company that operates a factory

Part 1: You work in HR for a company that operates a factory manufacturing fiberglass. There are several hundred empl

Details on advanced accounting paperthis paper is intended

DETAILS ON ADVANCED ACCOUNTING PAPER This paper is intended for students to apply the theoretical knowledge around ac

Create a provider database and related reports and queries

Create a provider database and related reports and queries to capture contact information for potential PC component pro

Describe what you learned about the impact of economic

Describe what you learned about the impact of economic, social, and demographic trends affecting the US labor environmen