Skip to content

Solving Pacman with Blind and Heuristic Search Techniques

License

Notifications You must be signed in to change notification settings

montymxb/pacman

 
 

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

44 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

PacMan with Blind and Heuristic Search

This repo contains a modified codebase for performing research on the domain of Pacman, with a focus on applying Blind and Heuristic search to attempt to produce solutions to levels in realtime.

Results indicate that BFS with sufficient depth performs well at solving single levels with 3 lives. Also strong indication that heuristics that prioritize distancing from ghosts greatly increase surviviability (as to be expected).

This paper looks into generating some compound heuristics that combine individual heuristics to attempt to compensate for shortcomings of indvidual heursitic approaches. Also of interest was adding in heuristics into a compound mix that prioritize better positioning throughout the game, such as by avoiding the far edges of the map or maintaining close distance to the average center of all capsules remaining in the maze.

Findings can be found in this course paper.

Based on Lucio Panepinto's Pacman in HTML5.

About

Solving Pacman with Blind and Heuristic Search Techniques

Resources

License

Stars

Watchers

Forks

Packages

No packages published

Languages

  • JavaScript 86.9%
  • HTML 6.6%
  • CSS 6.5%