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?
what is software cycle?give a diagramatic representation
use of intranet facility in infosys
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
_________________ are mathematical problems defined as a set of objects whose state must satisfy a number of constraints or limitations.
a) Constraints Satisfaction Problems
b) Uninformed Search Problems
c) Local Search Problems
d) Only a) and b)
Which were built in such a way that humans had to supply the inputs and
interpret the outputs?
b) AI system
A problem solving approach works well for
a) 8-Puzzle problem
b) 8-queen problem
c) Finding a optimal path from a given source to a destination
d) Mars Hover (Robot Navigation)
_______________ Is an algorithm, a loop that continually moves in the direction of increasing value – that is uphill
a) Up-Hill Search
c) Hill algorithm
d) Reverse-Down-Hill search
The game of Poker is a single agent.
In which state spaces does the online-dfs-agent will work?
a) Irreversible state spaces
b) Reversible state spaces
c) searchable state spaces
d) All of the mentioned
What is meant by simulated annealing in artifical intelligence?
a) Returns an optimal solution when there is a proper cooling schedule
b) Returns an optimal solution when there is no proper cooling schedule
c) It will not return an optimal solution when there is a proper cooling
d) None of the mentioned
Define procedural knowledge and declarative knowledge.
Stochastic hill climbing chooses at random from among the uphill moves; the probability of selection can vary with the steepness of the uphil1 move.
Fuzzy logic is extension of Crisp set with an extension of handling the concept of Partial Truth.
What is used for tracking uncertain events?
a) Filtering algorithm
d) None of the mentioned
Differentiate between documented and undocumented knowledge. 3. How is knowledge collected?