You are not logged in.
Pages: 1
?
'And fun? If maths is fun, then getting a tooth extraction is fun. A viral infection is fun. Rabies shots are fun.'
'God exists because Mathematics is consistent, and the devil exists because we cannot prove it'
I'm not crazy, my mother had me tested.
Offline
The algorithm for two player game to find the best move in a tree such as chess? Or, minimax approximation in curve fitting?
In mathematics, you don't understand things. You just get used to them.
If it ain't broke, fix it until it is.
Always satisfy the Prime Directive of getting the right answer above all else.
Offline
The one that is not for posting at the Computer Math section.
'And fun? If maths is fun, then getting a tooth extraction is fun. A viral infection is fun. Rabies shots are fun.'
'God exists because Mathematics is consistent, and the devil exists because we cannot prove it'
I'm not crazy, my mother had me tested.
Offline
Then you are out of luck. I used to be able to program it quickly and in tight code but that was a long time ago. I am afraid I have forgotten almost all of it.
In mathematics, you don't understand things. You just get used to them.
If it ain't broke, fix it until it is.
Always satisfy the Prime Directive of getting the right answer above all else.
Offline
OMG! What did you do with Minimax search?
'And fun? If maths is fun, then getting a tooth extraction is fun. A viral infection is fun. Rabies shots are fun.'
'God exists because Mathematics is consistent, and the devil exists because we cannot prove it'
I'm not crazy, my mother had me tested.
Offline
Seems I forgot everything about that and alpha beta pruning, razoring, singular extensions... I just remember the names now.
I do remember it is a way of pruning a tree. It was invented I think by the American genius Claude Shannon. He designed it for 2 player zero sum games.
In mathematics, you don't understand things. You just get used to them.
If it ain't broke, fix it until it is.
Always satisfy the Prime Directive of getting the right answer above all else.
Offline
The algorithm for two player game to find the best move in a tree such as chess? Or, minimax approximation in curve fitting?
Which one are you talking about?
'And fun? If maths is fun, then getting a tooth extraction is fun. A viral infection is fun. Rabies shots are fun.'
'God exists because Mathematics is consistent, and the devil exists because we cannot prove it'
I'm not crazy, my mother had me tested.
Offline
The one you wanted, "The algorithm for two player game to find the best move in a tree such as chess."
In mathematics, you don't understand things. You just get used to them.
If it ain't broke, fix it until it is.
Always satisfy the Prime Directive of getting the right answer above all else.
Offline
oh. Did you know it?
'And fun? If maths is fun, then getting a tooth extraction is fun. A viral infection is fun. Rabies shots are fun.'
'God exists because Mathematics is consistent, and the devil exists because we cannot prove it'
I'm not crazy, my mother had me tested.
Offline
Programmed it on a TI - 92 with 256 k of ram. It was awfully slow but it worked.
In mathematics, you don't understand things. You just get used to them.
If it ain't broke, fix it until it is.
Always satisfy the Prime Directive of getting the right answer above all else.
Offline
I have used it before too. And I am also a bit rusty in it ... it is one of those coding algorithms you apply to a specific situation, and when it works you go "wow, cool", and then move on to the next bit of coding and forget about it afterwards.
Your game needs to be able to assign a score after each move, higher scores are better for you.
And then (sorry if I get this wrong), for each move you can make you imagine your opponent chooses their best move (your min score), and then you choose the best of those (max of the min scores). It is like choosing the "best of the worst".
So if you have 3 possible moves: A, B , C
* after move A your opponent can have 2 moves, scoring -3 and +2 (remember higher is better for you), so they will probably do the move with score -3 (worst for you),
* after move B your opponent can have 2 moves, scoring -9 and +7, so they will probably do the move with score -9
* after move C your opponent can have 2 moves, scoring -1 and +9, so they will probably do the move with score -1
Your best choice is move C (the max of the min scores)
"The physicists defer only to mathematicians, and the mathematicians defer only to God ..." - Leon M. Lederman
Offline
Thanks. But isn't this something very obvious?
'And fun? If maths is fun, then getting a tooth extraction is fun. A viral infection is fun. Rabies shots are fun.'
'God exists because Mathematics is consistent, and the devil exists because we cannot prove it'
I'm not crazy, my mother had me tested.
Offline
Pages: 1