1 / 14

Treasure Hunt A* agent against semi-stochastic enemies

Treasure Hunt A* agent against semi-stochastic enemies . Jorge Aparicio Arturo Deza. Software. XNA Game Design Library Programmed in Visual Studio 2010 Language : C# Sprite and Texture modeling - The Legend of Zelda: A Link to the Past. GIMP Inkscape. Game Scenario. Rules.

ronnie
Télécharger la présentation

Treasure Hunt A* agent against semi-stochastic enemies

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Treasure HuntA* agent against semi-stochastic enemies Jorge Aparicio Arturo Deza

  2. Software • XNA Game Design Library • Programmed in Visual Studio 2010 • Language : C# • Sprite and Texture modeling - The Legend of Zelda: A Link to the Past. • GIMP • Inkscape

  3. Game Scenario

  4. Rules • We have a finite map – modeled as a 50 x 25 Matrix. • Obstacles/Walls exist in the dungeon. • 5 Enemies in the dungeon and respawn if slaughtered. • Only 1 Agent explorer. • The goal is to make the Agent get to the treasure with the maximum amount of Health. • No diagonal movements through obstacles.

  5. Enemy Layout Distribution

  6. Strategy and Parameters

  7. Bloodseeker Mode

  8. Agent A* Search

  9. ObstacleRadius parameter

  10. ObstacleRadius parameter

  11. Health Threshold & Remapping Rate • If (Health > HealthThreshold) -> FightEnemy if close; -> Otherwise, MoveAgent; • After every x moves -> Remap A* algorithm;

  12. Future Work • Use G.A. to determine optimal parameters. • Code Blocks to appear during Fairy A* algorithm. • Modify the Original Map to make it more Challenging!

More Related