• Post Reply Bookmark Topic Watch Topic
  • New Topic

A* / heuristic / minimax search  RSS feed

 
Greenhorn
Posts: 6
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
Good day,

Would I need a knowledge of A* / heuristic search in order to implement a Minimax search program?

Thanks
 
Author
Rancher
Posts: 12617
IntelliJ IDE Ruby
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
What do your investigations of both suggest?
 
Andy Friend
Greenhorn
Posts: 6
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
Well, heuristic search appears to be an informed process, which I believe Minimax is - I'm just trying to get my head around the evaluation of nodes / states at different stages. .
 
Ranch Hand
Posts: 492
Firefox Browser Linux VI Editor
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
minimax is a type of heuristic search where you apply a heuristic function at every state. So you wouldn't be able to correctly implement minimax unless you understand A*.

Hunter
 
  • Post Reply Bookmark Topic Watch Topic
  • New Topic
Boost this thread!