I'm taking a course on AI and today my professor said that there is
a solutions web page for the problems in the book.

Not being one to make anything easy on us :) he said we'd have to do
a little hunting to find it. So if anyone knows where I could find
it please let me know.

Thanks

I noticed that your list did not include A.I. Wars... A.I. Wars has
been described as 'the most fun you'll ever have programming'.  It's
a game that allows its players to design and code the A.I. of either
a Cybug or a Tank. It provides an editor to do your design and
coding along with full documentation of its CAICL language which is
easy for beginners to learn as well as deep enough for experienced
players to dig deep into as well. It provides a battle simulator
where you you can pit your favorite A.I.'s against each other to see
which one does the best.  The battles can be saved for later viewing
and they include a printable play-by-play report of each battle.

There are 3 versions of A.I. Wars available:

A.I. Wars (The Insect Mind) - Shareware - complete playable version
that allows up to 5 bots in a single battle.

A.I. Wars (The Insect Mind) - Registered - same as shareware version
but it includes more debugging tools, 10 bots per battle plus
tournament and 3D battle modes.

A.I. Wars (Armor Commander) - Registered - similar to the two
previous but it is 100% 3D, has more realistic terrain and uses
tanks instead of Cybugs.

There are educational site licenses available in adition to the
single user licenses and an A.I. Wars Collection CD.

You can read more about these, download the shareware version and
screen saver and other tools at: http://www.tacticalneuronics.com

Thanks,
John

Iam interested in AI .I need guidelines to solve the exercises in the
book"Artificial intelligence A modern approach".

Dear Group Member,

I am a PhD student in Urban Planning working in urban simulation
modeling.  My research is going toward using agent-based modeling
technique.  As I am completely  new to the this area of reaserch, I
register for an AI course teaching the text book AIMA.   I am also
looking forward to learn a programming language to help me building
agents applications.   I will appreciate your argent advice to select
between two introductory level courses offered this semester, one in
C++ and other in Java….   Which one to select??? Please help.

Thanks to all of you.

Dear Sir/Madam,

I suggest to use Java, since it is universally approved in academia and also it is easier to learn and code (since its higher level than C++).I Think you will enjoy it :).

                                                   Sincerely,
                                                   Mohammad Jannati

 "knasef <nasef@...>" <nasef@...> wrote:

Dear Group Member,

I am a PhD student in Urban Planning working in urban simulation
modeling.  My research is going toward using agent-based modeling
technique.  As I am completely  new to the this area of reaserch, I
register for an AI course teaching the text book AIMA.   I am also
looking forward to learn a programming language to help me building
agents applications.   I will appreciate your argent advice to select
between two introductory level courses offered this semester, one in
C++ and other in Java….   Which one to select??? Please help.

Thanks to all of you.    




To unsubscribe from this group, send an email to:
aima-talk-unsubscribe@yahoogroups.com



Your use of Yahoo! Groups is subject to the Yahoo! Terms of Service.

You'd actually be better off learning Python as an intro language, but
given the two choices of C++ or Java, it's easier to be productive more
quickly in Java. (Even though I am a C++ guy, there are too many
low-level details that most texts deal with, and you'd need a good
teacher to steer you toward high-level concepts like the STL. Most of
the time that doesn't happen.) Plus Java has some dynamic features that
can make it more like Lisp or Python.

Brandon

knasef wrote:

>Dear Group Member,
>
>I am a PhD student in Urban Planning working in urban simulation
>modeling.  My research is going toward using agent-based modeling
>technique.  As I am completely  new to the this area of reaserch, I
>register for an AI course teaching the text book AIMA.   I am also
>looking forward to learn a programming language to help me building
>agents applications.   I will appreciate your argent advice to select
>between two introductory level courses offered this semester, one in
>C++ and other in Java….   Which one to select??? Please help.
>
>Thanks to all of you.
>
>
>
>To unsubscribe from this group, send an email to:
>aima-talk-unsubscribe@yahoogroups.com
>
>
>
>Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/
>
>
>
>

I understand the concept of EM very much but don't know how to
calculate.
Would you like to give more detail of calculation in P.729? (For
example, how to get the figure 0.6124 in page 729, 0.6684 and -2044
in p.730.)

Thanks.

Hi Peter,

There's a reference error on page 156 of Chapter 5.
It reads "Haralick and Elliot (1980) favoured the minimal
forward checking algorithm described by McGregor (1979)...

They favoured the forward checking algorithm not MFC.  Also
McGregor wasn't the originator of FC, the first description I
know about is in:  S. Golomb and L Baumert, Backtrack programming,
Journal of the ACM, 12(4):516-524, 1965.

Mike

Hi I'am from sri lanka. I would like to know When will the 2nd
edition will be out on low price edition?

There is an international edition out.  I think you can contact
         prenhall@... for information.

-Peter

On Monday, April 7, 2003, at 08:11  PM, bhanu128 wrote:

> Hi I'am from sri lanka. I would like to know When will the 2nd
> edition will be out on low price edition?
>
>
> ------------------------ Yahoo! Groups Sponsor
> ---------------------~-->
> FREE Cell Phones with up to $400 Cash Back!
> http://us.click.yahoo.com/_bBUKB/vYxFAA/i5gGAA/7brrlB/TM
> ---------------------------------------------------------------------
> ~->
>
> To unsubscribe from this group, send an email to:
> aima-talk-unsubscribe@yahoogroups.com
>
>
>
> Your use of Yahoo! Groups is subject to
> http://docs.yahoo.com/info/terms/
>

Hello

Does anybody know about any international event about artificial intelligence to realize on next two months?

Regards

Hi,

Can any body point a place to start a FYP.

Thx

Will the AIMA authors and other interested parties please
establish Web links or jump-off points to the new AI textbook
"AI4U: Mind-1.1 Programmer's Manual" which goes beyond AIMA
and traditional AI textbooks by teaching the implementation
of an original, Chomskyan-linguistics-based theory of mind?

Please consider inserting an AI4U link at the page
http://www.cs.berkeley.edu/~russell/competing.html
or, mutatis mutandis, at any AI textbook site.

In the category, "Other Intro AI Texts," please list:

AI4U: Mind-1.1 Programmer's Manual
http://www.iuniverse.com/bookstore/book_detail.asp?isbn=0595654371

"Authors"
Murray
http://www.scn.org/~mentifex/

"Publisher"
iUniverse
http://www.iuniverse.com

"Year"
2002

"Code"
70K Forth
http://mind.sourceforge.net/mind4th.html

86K JavaScript
http://mind.sourceforge.net/jsaimind.html

TIA to the AIMA authors and others.

BTW, a very unusual (in bifurcated link format) AI4U Index is at
http://www.scn.org/~mentifex/ai4udex.html -- under construction.

I want to know the details of Early's Algorithm, can anyone tell me about it?

I would greatly appreciate if someone could help me find a Datalog
language (deductive databases) I could download and use. A 1-month
evaluation version would be just fine.

I did try http://www.dbai.tuwien.ac.at/proj/dlv but it didn't run on
Windows XP nor on Windows 2000.

Thank you

Franz

Biomedical and Health Informatics
The University of Washington
http://www.bhi.washington.edu

I'd be interested in an extension to csp Module (csp.py) which would
hand dle Higher-order Constraints as suggested on page 140, or
equivalently discussion of exercise 5.11.

Are you asking me to implement them, or are you offering to?

-Peter

On Monday, May 19, 2003, at 02:08  PM, george3770549 wrote:

> I'd be interested in an extension to csp Module (csp.py) which would
> hand dle Higher-order Constraints as suggested on page 140, or
> equivalently discussion of exercise 5.11.
>
>
>
> ------------------------ Yahoo! Groups Sponsor
> ---------------------~-->
> Get A Free Psychic Reading! Your Online Answer To Life's Important
> Questions.
> http://us.click.yahoo.com/Lj3uPC/Me7FAA/uetFAA/7brrlB/TM
> ---------------------------------------------------------------------
> ~->
>
> To unsubscribe from this group, send an email to:
> aima-talk-unsubscribe@yahoogroups.com
>
>
>
> Your use of Yahoo! Groups is subject to
> http://docs.yahoo.com/info/terms/
>

I'd be glad to try to implement such a beast.  I think the method
would be to define 'neighbors' groups for example neigbors = [[O R
X1],[X1 W  U X2],[X2 T O X3],[X3 F]]
A parse neighbors would split these into dictionary elements O:[O R X1]
R:[O R X1] X1:[O R X1] etc.

Then each reference to elements of neighbors list must be examined and
in most cases modified to properly handle lists of variables

The definition of the constraints function needs to be modified
it could be constraints(A,a,B,b...) with alternating vars and values
or constrains(Varlist,Vallist) with lists of variables and values.


Does this seem like a good way to go, or is it heading up or down a
blind alley?

george


--- In aima-talk@yahoogroups.com, Peter Norvig <peter@n...> wrote:
> Are you asking me to implement them, or are you offering to?
>
> -Peter
>
> On Monday, May 19, 2003, at 02:08  PM, george3770549 wrote:
>
> > I'd be interested in an extension to csp Module (csp.py) which would
> > hand dle Higher-order Constraints as suggested on page 140, or
> > equivalently discussion of exercise 5.11.
> >
> >
> >
> > ------------------------ Yahoo! Groups Sponsor
> > ---------------------~-->
> > Get A Free Psychic Reading! Your Online Answer To Life's Important
> > Questions.
> > http://us.click.yahoo.com/Lj3uPC/Me7FAA/uetFAA/7brrlB/TM
> > ---------------------------------------------------------------------
> > ~->
> >
> > To unsubscribe from this group, send an email to:
> > aima-talk-unsubscribe@yahoogroups.com
> >
> >
> >
> > Your use of Yahoo! Groups is subject to
> > http://docs.yahoo.com/info/terms/
> >

A significant revision to my earler thoughts on this issue:

After rereading problem 5.11 the tuple '[X Y Z]' should parse to
{'X':['Y','Z'],'Y':['X','Z'],'Z'['X','Y']}

-george

--- In aima-talk@yahoogroups.com, Peter Norvig <peter@n...> wrote:
> Are you asking me to implement them, or are you offering to?
>
> -Peter
>
> On Monday, May 19, 2003, at 02:08  PM, george3770549 wrote:
>
> > I'd be interested in an extension to csp Module (csp.py) which would
> > hand dle Higher-order Constraints as suggested on page 140, or
> > equivalently discussion of exercise 5.11.
> >
> >
> >
> > ------------------------ Yahoo! Groups Sponsor
> > ---------------------~-->
> > Get A Free Psychic Reading! Your Online Answer To Life's Important
> > Questions.
> > http://us.click.yahoo.com/Lj3uPC/Me7FAA/uetFAA/7brrlB/TM
> > ---------------------------------------------------------------------
> > ~->
> >
> > To unsubscribe from this group, send an email to:
> > aima-talk-unsubscribe@yahoogroups.com
> >
> >
> >
> > Your use of Yahoo! Groups is subject to
> > http://docs.yahoo.com/info/terms/
> >

Since this file has been mentioned recently, I'd like to ask how
finished it is. I tried running solve_zebra, and it bombs out with an
error. Also, it doesn't look like some of the other problems (like
N-Queens) have a direct way to execute.

Brandon

The zebra problem is difficult; you may have run out of memory.  What
error msg did you get?  You should get an answer eventually, but it
should take several minutes.

I added some example calls for N-Queens and the map problems.

I also moved the code to http://aima.cs.berkeley.edu/python

-Peter

On Wednesday, May 21, 2003, at 06:23  AM, Brandon Corfman wrote:

> Since this file has been mentioned recently, I'd like to ask how
> finished it is. I tried running solve_zebra, and it bombs out with an
> error. Also, it doesn't look like some of the other problems (like
> N-Queens) have a direct way to execute.
>
> Brandon
>
>
> ------------------------ Yahoo! Groups Sponsor
> ---------------------~-->
> Get A Free Psychic Reading!
> Your Online Answer To Life's Important Questions.
> http://us.click.yahoo.com/aM1XQD/od7FAA/uetFAA/7brrlB/TM
> ---------------------------------------------------------------------
> ~->
>
> To unsubscribe from this group, send an email to:
> aima-talk-unsubscribe@yahoogroups.com
>
>
>
> Your use of Yahoo! Groups is subject to
> http://docs.yahoo.com/info/terms/
>

>>> csp.solve_zebra()
House 1
Traceback (most recent call last):
   File "<pyshell#0>", line 1, in ?
     csp.solve_zebra()
   File "C:\Documents and Settings\Brandon
Corfman\Desktop\PyCode\csp.py", line 431, in solve_zebra
     for (var, val) in ans.items():
AttributeError: 'NoneType' object has no attribute 'items'

It definitely takes several minutes to get this error message -- I think
about 20-30 minutes on my P4. It looks like it's ending without finding
a solution?

Thanks for the new code; I'll give it a try.

Brandon

Peter Norvig wrote:

>The zebra problem is difficult; you may have run out of memory.  What
>error msg did you get?  You should get an answer eventually, but it
>should take several minutes.
>
>I added some example calls for N-Queens and the map problems.
>
>I also moved the code to http://aima.cs.berkeley.edu/python
>
>-Peter
>
>
>
>
>

--- In aima-talk@yahoogroups.com, Peter Norvig <peter@n...> wrote:
>
> I added some example calls for N-Queens and the map problems.
>

I must be missing something; I didn't see any difference in the files.
Am I looking in the wrong place?

Thanks,
Brandon

The latest version is now at aima.cs.berkeley.edu

You can see the output of the examples at
http://aima.cs.berkeley.edu/python/docex-log.html#csp.py

The file itself is at
http://aima.cs.berkeley.edu/python/csp.py

-Peter

On Thursday, May 22, 2003, at 11:45  AM, Brandon Corfman wrote:

> --- In aima-talk@yahoogroups.com, Peter Norvig <peter@n...> wrote:
>>
>> I added some example calls for N-Queens and the map problems.
>>
>
> I must be missing something; I didn't see any difference in the files.
> Am I looking in the wrong place?
>
> Thanks,
> Brandon
>

On Friday 23 May 2003 11:31, bhargav prajapati wrote:

> What the intelligence can create Fellings?

It all depends on what you mean by "feelings".

If you extend the question somewhat to "Can purely algorithmic processes
in a system result in the system having feelings", then you get one of
the hot topics of recent philosophy of mind. Important players are Ned
Block, David Chalmers, Thomas Nagel, John Searle, Sidney Shoemaker and,
of course, Daniel Dennett.

Basically, the debate boils down to an unmitigated opposition between
those who believe in (philosophical) Zombies and those who don't.
Zombies in this sense are creatures who behave absolutely
indistinguishable from ordinary people -- but who don't feel anything,
they don't have "qualia" (philo jargon for raw feelings).

So, if you would insist that feelings are something above and beyond
behavior, utterances, predispositions -- that is, things that can be
discernd from a scientific, third-person perspective. And if you
instead claimed that you have privileged, exclusive, first-person
access to "what it's like". Well, then there's no way from algorithmic
process to feelings.

People who favor this big-R Realist view of qualia conceive of the
feelings themselves as something in need of explanation. In my opinion,
this is a futile endeavor. Instead, I side with those (Dennett), who
more or less see our *verbal reports of feelings* as the thing to
explain. Feelings in this sense are (small-r) real, too, as they
obviously have an explanatory role in our mental economy.

HTH,
Michael

--
Michael Schuerig                 Not only does lightning not strike
mailto:schuerig@...          twice, it usually doesn't strike once.
http://www.schuerig.de/michael/  --Salman Rushdie, "Fury"

I finished reading the CSP chapter (the PDF file posted on the web
site)  over the weekend. I have a comment about one of the sentences
in section 5.2 talking about arc consistency.

On p. 146, it says that "although this [arc consistency] is
substantially more expensive than forward checking, the extra cost is
usually worthwhile." This doesn't seem to agree with the CSP survey
paper by Kumar (1992), which mentions that for loosely constrained
problems like N-queens that arc consistency is too expensive. (This is
also borne out by my own experience writing loosely-constrained CSPs
that have used AC-3.)

In this regard, I think that it would be good for section 5.2 to
actually have a brief mention of tightly constrained problems vs.
loosely constrained problems that would lead into a discussion of why
you would only apply FC vs. MAC/AC-3.

My 2 cents.

Best regards,
Brandon

On Tue, 3 Jun 2003, [iso-8859-1] Alberto Vera wrote:

> Hello:
>
> Could you tell me about any method to answer this questions?
> a) How many hidden layers do I set in a neural network?
> b) How many neurons do I set for each hidden layer ?
> c) how many layers is it better to set in a neural network?

These are /research/ questions. For c) minimum you have to have two, input
and output layers. a) and c) and number of links (it may not necessarily
be a fully-connected network) are a research component. Try :) To be
computationally-feasible on a "commodity" class machines don't try too
many hidden layers with many neurons in a fully-connected network.

To give a few numbers: in one of our projects a net of 512 input neurons,
32 output neurons, a hidden layer of 1024, then 512, then 256 (a total of
5 layers) on my PIII, 550Mhz, 512Mb of RAM has never completed because it
ran out of memory.

--
Serguei A. Mokhov
Computer Science Department
Concordia University