Game Development Reference
In-Depth Information
Exercises
1. Search for A* on the Internet. Write an A* implementation that directs the
fox in Fox and Hounds when there is an opening.
2. Change the graph in Figure 10.2 so that the catapult service is between node
A and node W at cost 0.5. Reduce the cost of road travel to or from node X
back to 4. A path from node C to node W through A now has an actual cost
of 12.5, while a path through node Z has cost 16. Prove to yourself that
regardless of whether the algorithm reexamines nodes on the closed list, the
inadmissible heuristic will cause the algorithm to return the longer path.
3. Search for neural network implementations on the Internet. Write one in
VB for our monster. When training the network, leave out training data
with hit-point values between the always fight and always flee levels. Watch
the network outputs in the transition area.
References
[Barnes02] Barnes, Jonty; Hutchens, Jason. ''Testing Undefined Behavior as a
Result of Learning,'' AI Game Programming Wisdom . Charles River Media, 2002.
[Biasillo02] Biasillo, Gari, ''Training an AI to Race,'' AI Game Programming
Wisdom , Charles River Media, 2002.
[Brickman] Brickman, Noah; Nishant, Joshi. ''HTN Planning and Game State
Management in Warcraft II.'' Available online at http://users.soe.ucsc.edu/
*nishant/CS244.pdf.
[Fikes71] Fikes, Richard; Nilsson, Nils. ''STRIPS: A New Approach to the
Application of Theorem Proving to Problem Solving.'' Artificial Intelligence , v2,
pp. 189-208. 1971.
[Hecker07] Hecker, Chris. Liner Notes for Spore/Spore Behavior Tree Docs , Web
page 2007. Available online at http://chrishecker.com/My_Liner_Notes_
for_Spore/Spore_Behavior_Tree_Docs .
[Isla05] Isla, Damian. ''Handling Complexity in the Halo 2 AI.'' Proceedings of the
2005 Game Developers Conference. CMP Media, 2005. Available online at http://
www.gamasutra.com/view/feature/2250/gdc_2005_proceeding_handling_.php .
 
 
Search Nedrilad ::




Custom Search