I was working on problem 3.4 (never did get very good at those sliding-block puzzles as a kid). I found the Berlekamp books at the library, but I haven't...
The graph-search and tree-search algorithms in chapter 3 of the 2nd edition use a "fringe" variable to maintain the queue of nodes. Does anyone know why the...
The collection of nodes is a queue of nodes that are on the fringe of the graph -- fringe meaning the frontier, or the leaf nodes of the expanding graph. We...
Hi all, Can anybody explain me the differences between intelligent agents and rational agents?.If they are different,mail me the details arrividervis gobinath...
Hi Gobinath, The computer hasn’t emotion like human. It can’t write some very beautiful song, like human. If computer do something, it will “do the right...
... Quite right about emotions. Now: I just wonder then, when a computer does the right thing and a human considers it also the right thing to do, then the...
Ah, I thought that fringe might be referring to a specific data structure I hadn't heard of before. Thanks for the explanation. Brandon Peter Norvig wrote: The...
Hi all, I am in need of certain guideliness for selecting a heuristic functions to a given problem. bfn gobinath Yahoo! India Matrimony: Find your partner...
Hi Vishal, U can try the website aaai.org.it's really cool for beginners vishal miragi <aztecvishu@...> wrote: can anybody suggest some good books or...
I think part b is designed to help you with part a. Look at the problem again ... you are trying to find the _shortest_ paths to the goal, not all possible...
I was also working on problem 3.4 and decided to look up the Berlekamp books. I only found very brief coverage of the eight-puzzle and nothing particularly...
Hi everyone, I am totally confused with uniform-cost search method.can anybody explain me that as soon as possible.I also in need of some more explanations for...
Do you have an understanding of breadth-first search and depth-first searches? I think you will need to get these down before you will understand the others. ...
The sum of the squares of Manhatan distances. ... From: "gobigredhuskers2000" <gobigredhuskers2000@...> To: <aima-talk@yahoogroups.com> Sent: Friday,...
... Our class has an assignment on this due soon, so I can't give you a specific answer; however, as a hint, consider rules one might apply for finding...
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...
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....
... 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...
... 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...
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...
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...
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...
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...
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...
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...
