Remember
Register
Algorithms Q&A
Smart HR Software
Get the algorithms textbook
Q&A
Questions
Unanswered
Ask a Question
AI Teams
Lecture Notes
Categories
All categories
Math Basics
(5)
Asymptotic Analysis
(36)
Divide & Conquer
(18)
Greedy Algorithms
(10)
Dynamic Programming
(19)
Backtracking/DFS/BFS
(2)
Branch & Bound
(6)
Graph Theory
(11)
NP-Completeness
(8)
Artificial Intelligence
(28)
Uninformed Search
(1)
Informed Search
(14)
CSP
(3)
MDP
(4)
Probability
(3)
HMM
(2)
Randomized Algorithms
(1)
Most popular tags
recurrence-relations
time-complexity
asymptotic-analysis
loops
graph
dynamic-programming
asymptotic-notation
greedy
substitution-method
a-star
np-completeness
nested-loops
vertex-coloring
mdp
log
analysis
probability
stochastic
heuristic
master-theorem
markov-model
n-puzzle
csp
graph-coloring
mvcs
small-oh
exponent
proof
viterbi
bayes-rule
hmm
tree-search
grid-world
admissible
n-queens
conflict
ai
clique
exam
coins
reduction
dfs
prime-numbers
sqrt
count
easy
sorted-lists
logn
example
recursive
gcd
independent-set
unsolvable
pcp
counter-example
not-master-theorem
modulus
algebra
most-likely-estimate
reinforcement-learning
direct-evaluation
meu
articulation-point
hotel-room
small-omega
limit-method
mle
graph-search
while-loop
greedy-suboptimal
job-assignment
maximize-value
gold
constraint-satisfaction-problem
8-puzzle
task-environments
min-max
peak
randomized
satisfiability
random-graph-generation
proxy
network
sudoku
branchandbound
d&c
degree-constrained
spanning-tree
vertex-cover
branch
subtree
series
pmi
bound
contradiction
math
backtracking
tree
minimize
floors
Give an example of a task environment that is..
0
votes
Give an example of a task environment that is..
Episodic and Discrete
Continuous and Episodic
Continuous, Non-Deterministic and Non-Episodic.
For each of the combinations above, give an example of a task environment.
task-environments
asked
Jan 25, 2019
in
Informed Search
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
1
Answer
+1
vote
For Episodic and Discrete, I think the baseball game meets the criteria. Every ball has no relationship with next ball( not in a real baseball game), so it is episodic. Good balls that are caught and bad balls have not been caught make it discrete.
For Continuous and Episodic, digital image analysis is a good example. The images are isolated and for images, they are continuous.
For Continuous, Non-Deterministic and Non-Episodic, most of the chemistry reaction controller are meet the criteria. The reactions are continuous, what will happen is stochastic not only because the same reactants have different reactions in different situations, but also because of impurity effect or other conditions. Some reaction will create a new substance, so it is sequential.
answered
Jan 25, 2019
by
Ruan XiangNing
AlgoMeister
(
968
points)
Please
log in
or
register
to add a comment.
Related questions
0
votes
3
answers
Give an example of a graph that has 6 vertices, 9 edges, but does not have a clique on 3 vertices
asked
Dec 11, 2023
in
Graph Theory
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
graph
clique
+1
vote
2
answers
Give an example of a graph without an articulation point, a Hamiltonian cycle, or a 2-coloring
asked
Jul 8, 2018
in
Graph Theory
by
basil
Active
(
340
points)
graph
vertex-coloring
graph-coloring
0
votes
2
answers
Give a Proof by Induction that the sum of squares of first n natural numbers is n. (n+1). (2n + 1) / 6.
asked
May 21, 2021
in
Math Basics
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
sum
pmi
induction
proof
0
votes
1
answer
Example of a graph that is connected, has articulation point, needs 4 colors, and does not have a 4-clique
asked
Dec 10, 2022
in
Graph Theory
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
graph-coloring
graph
articulation-point
exam
0
votes
1
answer
Is Harmonic Mean of admissible heuristics an admissible heuristic?
asked
Apr 8, 2019
in
Informed Search
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
admissible
heuristic
a-star
The Book: Analysis and Design of Algorithms
|
Presentations on Slideshare
|
Lecture Notes, etc
...