Advertisement

challenge

Started by June 07, 2010 04:32 AM
10 comments, last by IADaveMark 14 years, 5 months ago
Quote: Original post by InnocuousFox
It's a decent way. Sure, on a small scale, the problem is tractable and you can just brute-force it as you suggested. However, that doesn't scale well.

It's not so much "Bayesian vs. something else" as "how you represent your PDF" (e.g., as a Bayes net)... since representing the whole PDF without any assumptions has the same complexity as brute-forcing (and is in the 0-1 case entirely equivalent).

Quote: Original post by alvaro
If you are fed the results one by one, you can have a container with the surviving possibilities, and filtering from it will get faster and faster as its size is reduced.

...which is just a sparse representation of your Bayesian probability distribution...

Also: Doesn't Wikipedia give an algorithm?
Quote: Original post by Emergent
Also: Doesn't Wikipedia give an algorithm?

Amused Dave is amused.

Dave Mark - President and Lead Designer of Intrinsic Algorithm LLC
Professional consultant on game AI, mathematical modeling, simulation modeling
Co-founder and 10 year advisor of the GDC AI Summit
Author of the book, Behavioral Mathematics for Game AI
Blogs I write:
IA News - What's happening at IA | IA on AI - AI news and notes | Post-Play'em - Observations on AI of games I play

"Reducing the world to mathematical equations!"

This topic is closed to new replies.

Advertisement