hello, 1. I am doing exercise 8.3. It is as follows: Encode the description of the 4-bit adder in figure 8.10 and pose the queries to verify that it is in fact...
Hello, I am studying "/search/domains/tsp.lisp" source code, which is about "Travelling salesperson Problem". In the source code, there is a requirement to the...
Hello, I found "/search/domains/vacuum.lisp" source code is a little old. Because in the above "domains" directory, other files are written with a style of...
Hello, I am reading "search/domains/tsp.lisp" and "route-finding.lisp" files. The author explains that "h-heuristic" function is a relaxed version of a minimum...
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...
Hello everyone: Now i'm doing the exercise 3.14 on the 1st edition. My professor named it with Google's search? Does google use bidirectional search? I have...
Has anyone tried to work the example on pages 713/714 (second edition)? I cannot got equation 20.1 to match the graph on page 714 (figure 20.1(a)). For...
for some reason, i really feel that some problmes in the textbook are really ambiguous, or hard to understand what it asks for. Or just because I am too...
Hi everyone, I have read "vacuum.lisp", "utility.lisp" source code. The function "rotate" in the "utility.lisp" make me puzzle. The purpose of "rotate"...
Hello: Could you tell me what is the difference and similarity between a Neural Network and a Method Numeric like Euler's Algorithm? I think both have a...
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...
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...
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...
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...
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--> ...
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...
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...
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...
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...
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....
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 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...
trying to answer question 3.15 part a of 2002 print am i right to assume its the formula we are after? if so any clues to which pages to look at and paths to...
