Thanks for the references. You're right, they were much more helpful than Berlekamp. Berlekamp is one of those sets of books which would be fun to get into...
227
icewind0
Oct 4, 2003 7:46 pm
I think Exercise 6.8 is unclear in describing what it is asking the student to do. I think my problem is that I'm having trouble visualizing the game tree....
228
Serguei Mokhov
stgunya
Oct 4, 2003 8:06 pm
... From: "icewind0"; <icewind0@...> Sent: October 03, 2003 2:31 PM ... No. It only defines a particular path within the tree. ... An outcome of N rolls...
229
Peter Norvig
norvig
Oct 4, 2003 8:20 pm
... A die-roll sequence is 8 rolls (say). There are 50 different sequences. Each one determines a game tree. In each of those trees, there are only moves for...
230
Gobinath
gobinath_kvp
Oct 5, 2003 10:41 pm
Hi all, What happens when two Deep Blue Chess Program[Deep Blue A vs. Deep Blue B] compete with each other?.Is this game leads to draw? what are the factors...
231
soft903
Oct 6, 2003 6:35 am
I would like to what is the Difference of Greedy Best 1st Search and A* Search? In my knowledge, Greedy is using f(n) = h(n), where h(n) is the heuristic...
232
Maithreebhanu
bhanu128
Oct 8, 2003 10:20 am
I think it will end in a draw. But if it ended in a win it would be more facinating. bhanu Gobinath <gobinath_kvp@...> wrote: Hi all, What happens when...
233
Alex0215
h5641kimo
Oct 18, 2003 3:33 am
hi all : i just download the java code from the respository, and then i try out the CSP search program, but i find out that the things weird, the ac-3...
234
denzrule
Oct 18, 2003 3:34 am
hi. I'm a student at the University of Texas Arlington and I'm trying to implement first order logic without quantifiers in C/C++ .... any tips.. pls email to...
235
hkstudentinuk
Oct 18, 2003 4:49 pm
Hi there everyone I am new to AI, just starting a new couse. what is the definition of admissible?? is admissible an algorithem? is the definition of it "never...
236
fakarim_nsu
Oct 19, 2003 3:08 pm
Hi there, "admissible" heuristic can be any function.But provided that it cannot overestimate the cost to reach the goal!for example in the 8 puzzle problem in...
237
Brandon Corfman
bcorfman
Oct 20, 2003 4:22 pm
If I'm understanding your message correctly, you mean that the method AC-3 "does nothing" for the CSP instance you are working on? Certainly it has a purpose...
238
Raicho Tchalkov
chalkov
Oct 21, 2003 12:40 am
On page 418 in the second edition of the book it is said "each of the actions in the assembly of C1 have a 10-minute window in which they can be started" This...
239
gSm Shourov
gsmshourov
Oct 21, 2003 12:40 am
Admissible Heuristic: #Def : A heuristic function (h(n)) with restriction that never overestimates the path cost ('n'-->'G'). where 'n'= any node/state along...
240
gobigredhuskers2000
gobigredhusk...
Oct 24, 2003 5:35 am
anyone has idea what's the point for the line (whose minimax value is already known) included in the question b. If the minimax value is already known, why we...
241
A.T. Murray
mentifex
Oct 30, 2003 1:23 am
A question about the Chapter Seven exercises has been posted at http://www.ai-forum.org/topic.asp?forum_id=1&topic_id=10450 ... that could help....
242
Jeffrey Sta. Ana
jeffrey_sta_ana
Nov 1, 2003 6:27 pm
Does anyone know how to compute for the posterior probability of H given this bayesian net? what if I added more variables pointing to H? A--> <--B H C--> ...
243
chenyu468
Nov 12, 2003 4:27 am
hi everyone, 1. According to the guide, it is necessary to build a binary-tree for representing the "state". The tree's leaves are "1" or "n" and internal...
244
Rajib
rajib_2002bd
Nov 15, 2003 4:32 am
Hi comrades Can any one have solution of Exercise(9.1 and 9.4). RaJ...
245
Brandon Corfman
bcorfman
Nov 15, 2003 4:33 am
I'm not sure what you mean by "dead end". If a node can be broken down, into a new center node and two leaves, then at some point, the whole process will stop...
246
SingleAgent
Nov 15, 2003 4:36 am
Question 8.2 asks "Consider a knowledge base containing just two sentences: P(a) and P (b). Does this knowledge base entail For All x P(x)? Explain in terms of...
247
shahin_joon_2002
shahin_joon_...
Nov 15, 2003 4:37 am
Dear All I have a Question about ABSOLVER . In page 103 it is witten that "Recently a program called ABSOLVER was written that can generate heuristics...
248
hhajizadeh1008
Nov 16, 2003 6:25 pm
Gashtam Nabood Nagard Nist ;) Hajix ... was...
249
chenyu468
Nov 16, 2003 6:26 pm
Hi everyone, I want to discuss the relationship between (DB or dataming) and AI. In my everyone work, I write the enterprise's application using database. DB...
250
chenyu468
Nov 16, 2003 6:26 pm
... Is it possible to write the exercise details here? Because I just have the version 1 of AIMA. Therefore I have exercise 9.1 and 9.4 of version2 of AIMA. ...
251
chenyu468
Nov 16, 2003 6:26 pm
... What I means: "dead end" means "It is impossible to further expand the node, that's no possible action" If a node can be broken ... further ... According...
252
Peter Norvig
norvig
Nov 16, 2003 8:58 pm
253
George LeCompte
george3770549
Nov 17, 2003 5:18 pm
AIMA 2nd edition page 744 claims "In fact, with a single, sufficiently large hidden layer, it is possible to represent any continuous function of the inputs...
254
sam_tardif
Nov 17, 2003 5:57 pm
Hello, I'm a high school student from Australia. I just got AIAMA from a uni library, and must say that so far it has been an excellent read. However, I would...
255
Fathi Salaymeh
fathi_kazem
Nov 18, 2003 5:56 am
Hi everybody; I'm asking if there is any one who can help be in solving Exercise 3.4 page 89 in our text book. please if there is anybody who have the...
