Could anyone explain in english the basic idea behind these topics.
The purpose of this thread is to get local Cprogrammers input and to increase interest in this topic.
Could anyone explain in english the basic idea behind these topics.
The purpose of this thread is to get local Cprogrammers input and to increase interest in this topic.
My take, many years ago I read a book on artificial intelligence and my memory is poor but here goes.
Binary trees are often used because you may quickly search for any given data.
The idea behind probability trees is to find the highest or lowest probability quickly. MINI MAXING means the data on the branches of the tree are weighted based on there distance from the root, and staticaly by the probability based on its distance (and often position depending on your traversal method) from the root. The weighted numbers are essentialy odds, while the position is a guess based on the odds.
I invite any comments because it has been so long that I feel very shaky even replying under my own post.
It is evident that these terms may be looked up via a search engine.
They are, however, memory inefficient.Binary trees are often used because you may quickly search for any given data.
dwk
Seek and ye shall find. quaere et invenies.
"Simplicity does not precede complexity, but follows it." -- Alan Perlis
"Testing can only prove the presence of bugs, not their absence." -- Edsger Dijkstra
"The only real mistake is the one from which we learn nothing." -- John Powell
Other boards: DaniWeb, TPS
Unofficial Wiki FAQ: cpwiki.sf.net
My website: http://dwks.theprogrammingsite.com/
Projects: codeform, xuni, atlantis, nort, etc.
I had to do a project using the minimax algo for an AI class, I initially designed it using trees but it was ungodly slow, then I just did it as a couple of functions in C, which was a lot faster yet harder to read.
