You're tasked with implementing a crowd that walks around the streets of a city. Describe some ways you could implement this in a fast and efficient manner. How do you ensure that crowd members don't touch each other while moving? How do you get crowd members to get out of each others way, and ensure that no two crowd members can get stuck trying to get around each other?
You're implementing a medieval strategy game in which pikemen should always walk in front of archers, and catapults should always be behind the archers. Explain how you could implement the movement system to ensure that you keep pikemen in front and catapults in the rear as much as possible. Explain how your answer might be different depending on whether or not the units simply need to end up in that configuration when they reach that destination, or if they need to maintain that formation while moving.
As you're starting work on your game, one of your colleagues suggests avoiding pathfinding completely, and just using potential fields for pathfinding and navigation. He suggests that you just overlay a big 2D grid over the world, with each cell indicating the distance to the nearest obstacle. Is his idea feasible? Why or why not? When would it cause problems? Regardless of the answer to that question, what are some of the other ways that such a system could be used?
Constraint satisfaction problems on finite domains are typically solved using a form of ___________.
a) Search Algorithms
b) Heuristic Search Algorithms
c) Greedy Search Algorithms
d) DFS/BFS Search Algorithms
The term ___________ is used for a depth-first search that chooses values for one variable at a time and returns when a variable has no legal values left to assign.
a) Forward search
b) Backtrack search
c) Hill algorithm
d) Reverse-Down-Hill search
Which are necessary for an agent to solve an online search problem?
b) Step-cost function
d) All of the mentioned
What is the output of the given statement?
* (defclass article() ((title :accessor article-title :initarg :title) (author :accessor article-author :initarg :author)))
* (defclass computer-article (article) ())
* (defclass business-article (article) ())
* (defclass political-article (article) ())
* (setf articles (list (make-instance ‘business-article :title “Memory Prices down”)))
a) Business article
b) Political article
c) Business article
Though local search algorithms are not systematic, key advantages would include
a) Less memory
b) More time
c) Finds a solution in large infinite space
d) No optimum solution
Fuzzy logic is extension of Crisp set with an extension of handling the concept of Partial Truth.
A solution to a problem is a path from the initial state to a goal state. Solution quality is measured by the path cost function, and an optimal solution has the highest path cost among all solutions. State whether true or false.
Which agent enables the deliberation about the computational entities and actions?
d) None of the mentioned
The room temperature is hot. Here the hot (use of linguistic variable is used) can be represented by _______ .
a) Fuzzy Set
b) Crisp Set
Stochastic hill climbing chooses at random from among the uphill moves; the probability of selection can vary with the steepness of the uphil1 move.
Where does the performance measure is included?
a) Rational agent
b) Task environment
Are Bots and Intelligent Agents personal search engines?
Satellite Image Analysis System is (Choose the one that is not applicable).
c) Single agent
d) Partially Observable
Consider a problem of preparing a schedule for a class of student. This problem is a type of
a) Search Problem
b) Backtrack Problem
d) Planning Problem