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

*To*: Juan Guzman <jcguzma1@asu.edu>*Subject*: Re: Question related to previous lecture.*From*: Subbarao Kambhampati <rao@asu.edu>*Date*: Fri, 20 Apr 2012 17:51:39 -0700*Dkim-signature*: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=20120113; h=mime-version:sender:in-reply-to:references:from:date :x-google-sender-auth:message-id:subject:to:content-type; bh=EJtKKFZHlWdQE1ZUAvKlTYTYE4AHPSxPEz9fu5o1GEw=; b=SGaKJCGD3LPYwqS/O/ebj7Cf5m3BDNeW3dUDyXXZSjYJNSugoJ3BskiQiR12YQZRY8 kWxUQR7cgcSHZnGiRwo3/pz3SPBtG/WVulZPGeI8/EY0DkwgpZKcWK5GYyR8oTtKUZhS VNr7J2svcouo5cCzM72Q05ON3qvK9DuZ7gTJbL3fD0smVDg6BHC5iY08nNjcHgVMoMue CQZ4Gz8JqDiLPctws4CbFoDuq9MIS/1puCDVuVNOfgDdD0W6iQUpM9mP7+vlNC777mqW Azfuf6NvN2BlnntKUFMcQJ5egoZoeQeBmwN5VG1f7xbN8NHg+nNyTF59Bz8z7D2w26in //9w==*In-reply-to*: <CAAHz8m9ou608K3jYMp3wMDvuLBMu0DG2VWmkFU8dZVQ=ACJSrQ@mail.gmail.com>*References*: <CAAHz8m9ou608K3jYMp3wMDvuLBMu0DG2VWmkFU8dZVQ=ACJSrQ@mail.gmail.com>*Sender*: subbarao2z2@gmail.com

Opponent modeling is done a lot of time (and for games like Poker, it is pretty much

It may be less critical in chess where, at least at the grand master level, "optimal opponent" is a reasonable assumption.

I don't off hand know whether Deep Blue did opponent modeling to any extent--the classic reference on

Deep Blue is this paper:

Rao

On Fri, Apr 20, 2012 at 5:02 PM, Juan Guzman <jcguzma1@asu.edu> wrote:

I had this thought during class, but I wasn't sure if it was necessarily relevant to the lecture.

Do agents like deep blue always assume an optimal opponent such as Kasparov? It seems to me that one would be able to deduce the expertise level of an opponent using the existing information of the game tree and analyzing the opponent's moves. Like the example you gave in class, If Kasparov would take 10 minutes to make a move against a 5 year old, we would consider it silly; If deep blue saw that the opponent kept making moves that were highly in its favor (mistakes) could we use that information to make the agent execute moves more suited to the situation? Rather than assuming that it's playing against a grand master and using min max, we can calculate the possibility of the opponent making an arbitrary (non optimal) move and make "bolder" moves as a result? Or does deep blue already make optimal moves regardless of the skill level of opponents?- Juan

Sent from my mobile device

- Prev by Date:
**Clarification on the homework..** - Next by Date:
**Re: Question related to previous lecture.** - Previous by thread:
**Clarification on the homework..** - Next by thread:
**Re: Question related to previous lecture.** - Index(es):