Questions tagged [norvig-russell]
For questions related to the book "Artificial Intelligence: A Modern Approach" by Peter Norvig and Stuart J. Russell.
35
questions
0
votes
1
answer
31
views
Unable to understand Figure 3.13 Artificial Intelligence: a Moder Approach
I'm currently studying the functionality of BFS and the AIMA book shows
.
I am unable to replicate them using some trivial calculations.
For example, if the BFS generates $10^6$ nodes per second and I ...
0
votes
0
answers
157
views
How do derive the time complexity of alpha beta pruning
I think I understand how the time complexity of minimax was derived, I believe it is basically the same as the uniformed Breadth- first search algorithm which is:
In terms of time and space, imagine ...
- 1
0
votes
1
answer
353
views
Can A* be non-optimal if it uses an admissible but inconsistent heuristic with graph search?
The book "Artificial Intelligence: A Modern Approach" (4th edition, global version) says
"With an admissible heuristic, A* is cost-optimal...".
An admissible heuristic is one ...
- 1
0
votes
0
answers
50
views
How to relate the definition for entailment, with soundness and completeness?
Is it fair enough to say for a language model, φ, which makes certain variable A true, and if φ also makes another variable B true, then we can conclude:
A ⊨ B
And for a certain inference calculus c,...
1
vote
1
answer
74
views
AIMA, Mutation in Genetic Algorithm
With regards to the highlighted line, the authors earlier stated that:
The mutation rate, which determines how often offspring have random mutations to
their representation. Once an offspring has ...
- 13
1
vote
0
answers
288
views
What happens if MIN plays suboptimally and unpredictably?
The following quotes are an extract from AIMA, 3ed.
The definition of optimal play for MAX assumes that MIN also plays optimally—it maximizes the worst-case outcome for MAX. What if MIN does not play ...
- 21
3
votes
1
answer
292
views
Can we achieve optimality with minimax using an evaluation function?
The following quote (from AIMA) refers to the situation in which the minimax algorithm computes its values directly from the terminal states.
(The) definition of optimal play for MAX assumes that MIN ...
- 31
1
vote
0
answers
119
views
Is N the total number of nodes in the frontier plus the number of nodes in the explored list?
I'm studying fundamentals of AI from the classic Russell-Norvig book (3rd edition). I have a small doubt about the effective branching factor, which is defined as follows (section 3.6.1, p. 103):
One ...
- 111
1
vote
0
answers
158
views
What is my mistake in applying the AC-3 algorithm on this problem?
I want to apply AC-3 algorithm to the following CSP:
There are two variables $A$ and $B$.
Domain of $A: \{0, 1, 2, 3, 4, 5, 6, 7, 8, 9\} $
Domain of $B: \{0, 1, 2, 3, 4, 5, 6, 7, 8, 9\} $
The ...
- 123
0
votes
1
answer
61
views
Why is $P(X_{t+1} \mid e_{1:t}, e_{t+1}) = \alpha P(e_{t+1} \mid X_{t+1}, e_{1:t}) P(X_{t+1} \mid e_{1:t})$ true in Norvig & Russell's book?
On page 572 of Norvig & Russell's AI book (edition 3)
Going from the first line to the second line in one shot like that, I am lost.
Can someone walk me through it step by step?
I tried but got:
$...
- 115
0
votes
1
answer
74
views
Why don't we wait if there is no patrons, in this decision tree from Russel and Norvig's book?
I'm reading Russel-Norvig's book about artificial intelligence and now at chapter decision tree where this figure is shown:
So far I understood it. This decision tree should answer the question if we ...
- 131
3
votes
1
answer
181
views
Is there an error in A* optimality proof Russel-Norvig 4th edition?
In "AI: A Modern Approach", 4th edition, by Russell and Norvig, they give a purported proof that A* is cost-optimal for any admissible heuristic. The given proof seems most certainly wrong. ...
- 81
2
votes
2
answers
357
views
Why is there a 1 in complexity formula of uniform-cost search?
I am reading the book titled Artificial Intelligence: A Modern Approach 4th ed by Stuart Russell and Peter Norvig. According to the book, the complexity of uniform-cost search is as
$$
O(b^{1+\lfloor{...
- 123
3
votes
1
answer
617
views
How DFS may expand the same state many times via different paths in an acyclic state space?
I am reading the book titled Artificial Intelligence: A Modern Approach by Stuart Russell and Peter Norvig (4th edition) and came across this sentence about depth-first search (page 79, line 12):
For ...
- 123
0
votes
1
answer
1k
views
Why is this vacuum cleaner agent rational?
This is the vacuum cleaner example of the book "Artificial intelligence: A Modern Approach" (4th edition).
Consider the simple vacuum-cleaner agent that cleans a square if it is dirty and ...
- 123
6
votes
2
answers
4k
views
What is the difference between the US and global edition of the AIMA book by Russell and Norvig?
The book Artificial Intelligence: A Modern Approach by Russell and Norvig has two editions: global and the US. It looks like these two are generally the same, but have some differences in the order of ...
- 205
1
vote
1
answer
462
views
How does randomization avoid entering infinite loops in the vacuum cleaner problem?
Suppose we have a vacuum cleaner operating in a $1 \times 2$ rectangle consisting of locations $A$ and $B$. The cleaner's actions are Suck, ...
- 205
2
votes
0
answers
239
views
Understanding conflict set generation for conflict directed backjumping
I was reading Constraint Satisfaction Problem chapter from Artificial Intelligence 3rd ed book by Peter Norvig et al. On page 219, section 6.3 it explains computation of conflict set for conflict ...
- 221
1
vote
1
answer
824
views
What is the difference between a performance standard and performance measure?
I am reading AI: A Modern Approach. In the 2nd chapter when introducing different agent types, i.e., reflex, utility-based, goal-based, and learning agents, I understood that all types of agents, ...
- 21
3
votes
1
answer
227
views
Are Genetic Algorithms suitable for problems like the Knuth problem?
We all know that Genetic Algorithms can give an optimal or near-optimal solution. So, in some problems like NP-hard ones, with a trade-off between time and optimal solution the near-optimal solution ...
- 217
1
vote
0
answers
1k
views
What is the difference between derivation and entailment?
In section 7.3 of the book Artificial Intelligence: A Modern Approach (3rd edition), it's written
An inference algorithm that derives only entailed sentences is called sound or truth-preserving.
The ...
- 608
2
votes
1
answer
1k
views
Why would the lookup table (of a table-driven artificial agent) need to store data at pixel precision?
While reading the book AI A modern approach, 4th ed, I came across the section of "Agent program" with following text:
It is instructive to consider why the table-driven approach to agent
...
- 123
4
votes
1
answer
822
views
What does the statement with the max do in the recursive best-first search algorithm?
I am reading the book "Artificial Intelligence: A Modern Approach" by Stuart and Norvig. I'm having trouble understanding a step of the recursive best-first search (RBFS) algorithm.
Here's the ...
- 151
3
votes
1
answer
4k
views
Understanding the pseudocode of uniform-cost search from the book "Artificial Intelligence: A Modern Approach"
On page 84 of Russell & Norvig's book "Artificial Intelligence: A Modern Approach Book" (3rd edition), the pseudocode for uniform cost search is given. I provided a screenshot of it here for your ...
- 321
3
votes
1
answer
539
views
What is the difference between the concepts "known environment" and "deterministic environment"?
According to the book "Artificial Intelligence: A Modern Approach", "In a known environment, the outcomes (or outcome probabilities if the environment is stochastic) for all actions are given.", and ...
- 31
3
votes
1
answer
1k
views
A* and uniform-cost search are apparently incomplete
Consider the following diagram of a graph representing a search space.
If we start at $B$ and try to reach goal state $E$, the lowest-cost first search (LCFS) (aka uniform-cost search) algorithm ...
- 165
3
votes
1
answer
3k
views
What does the Markov assumption say about the history of state sequences?
Does the Markov assumption say that the conditional probability of the next state only depends on the current state or does it say that the conditional probability depends on a fixed finite number of ...
- 445
4
votes
1
answer
103
views
What is the difference between a problem representation and problem modelling?
As far as I know, a problem representation is the formulation of the problem in a way that it can be programmed and therefore solved (for example, you can represent the $N$-queens problem by using an ...
- 343
0
votes
2
answers
2k
views
How can I solve part b of exercise 3.6 from the book "Artificial Intelligence: A Modern Approach"?
I am trying to solve part b of the exercise 3.6 (page 113) from the book Artificial Intelligence: A Modern Approach.
More specifically, I need to give a complete problem formulation (that is precise ...
- 323
5
votes
2
answers
963
views
When is a knowledge base consistent?
I am studying a knowledge base (KB) from the book "Artificial Intelligence: A Modern Approach" (by Stuart Russell and Peter Norvig) and from this series of slides.
A formula is satisfiable ...
- 263
1
vote
1
answer
73
views
Which "assumptions" made about the state space are Russell and Norvig referring to in their book?
I am reading the cornerstone book, "Artificial Intelligence, A Modern Approach" by Stuart Russel, and Peter Norvig, and there is a passage in the book on page 98:
The complexity results ...
- 287
11
votes
2
answers
3k
views
What are some alternatives to the book "Artificial Intelligence: A Modern Approach"?
There are two textbooks that I most love and am most afraid of in the world: Introduction to Algorithms by Cormen et al. and Artificial Intelligence: A Modern Approach by Norvig et al. I have started ...
- 111
7
votes
1
answer
949
views
Are all fully observable environments episodic?
According to the definition of a fully observable environment in Russell & Norvig, AIMA (2nd ed), pages 41-44, an environment is only fully observable if it requires zero memory for an agent to ...
- 171
6
votes
1
answer
3k
views
How to turn a ternary constraint into three binary constraints?
I'm trying to solve problem 6.6 from the book Artificial Intelligence: A Modern Approach, by Peter Norvig and Stuart Russell.
This is in the context of Constraint Satisfaction Problem and how you can ...
8
votes
1
answer
13k
views
What is the difference between an agent function and an agent program?
In section 2.4 (p. 46) of the book Artificial Intelligence: A modern approach (3rd edition), Russell and Norvig write
The job of AI is to design an agent program that implements the agent function — ...
- 427