[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

*To*: Elliot Drown <edrown@asu.edu>*Subject*: Re: Question on Homework 1*From*: Subbarao Kambhampati <rao@asu.edu>*Date*: Fri, 27 Jan 2012 13:00:25 -0700*Dkim-signature*: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=gamma; h=mime-version:sender:in-reply-to:references:date :x-google-sender-auth:message-id:subject:from:to:content-type; bh=TFOoF8/zuncxNStB9aGHawtKDKUIGzIO2oeBZtS7Ows=; b=swIOYkdcr+UNS4DGBeB5A0LvAj85AU+I6SfcmXXQSvvlWTfGEuG6ZPDjQSLWP9LRPG 8rdUt96sNQa+25stEFPMgLakgtia3PiqR3cmJNK6ZvFIKMu7BcTrmubAWWhHZ5afW/rH AGT39+VVmUonRp7YzBm93S9uzW50DhezE0eu4=*In-reply-to*: <CADdgohbQNZ4FanSLVZuTxcp8YL6KUoLYQ5AYz58mwBzNSCtJpg@mail.gmail.com>*References*: <CADdgohbQNZ4FanSLVZuTxcp8YL6KUoLYQ5AYz58mwBzNSCtJpg@mail.gmail.com>*Sender*: subbarao2z2@gmail.com

Note that you are searching on a finite depth tree where *all the solutions are at the leaf level, but are distributed non-uniformly.

This means that if you make an early mistake in choosing the children at the top of the tree, you can get into barren parts of the tree and waste time.

What you need is a way to somehow probe different parts of the final level efficiently.

See if the search algorithm given facilitates this..

Rao

On Fri, Jan 27, 2012 at 12:49 PM, Elliot Drown <edrown@asu.edu> wrote:

Hello,I am having some difficulty in understanding the algorithm in question 7.2, and why it might provide better performance than other search techniques. Can you clarify the algorithm and the idea behind it for me? Any additional information you can provide would be much appreciated.Thank you for your time,Elliot Drown

- Prev by Date:
**I have added a 11min/15mb flash file that walks you through A* and IDA* search on an example graph** - Next by Date:
**My absence during the week of Feb 5th** - Previous by thread:
**I have added a 11min/15mb flash file that walks you through A* and IDA* search on an example graph** - Next by thread:
**My absence during the week of Feb 5th** - Index(es):