MiniMax and repeated states

What have you done at this question? I'm not to sure about handling the repeated states.

I am only now starting to go through the chapters, haven't even started with the assignment. Don't even know yet what MiniMax is.... sorry.

Which question is this?

Normally you just ignore a repeated state...

I don't remember(dont have the tut nearby) I think its nr 4

They specifically ask about the repeated states

Ahh.. In that question I said that the algorithm should always choose the winning path when faced between that and a question mark.

I have done it all but Q5, which is semi-stumping me.

I am going to leave that until tomorrow evening, to see if I can un-stump or will submit without that question answered.

Well, mine's submitted, but I left out the 2 graphs as I can't figure out how they should look like.

I am very stumped with changing the algorithm for minimax.. but I know its simple..

I am about to submit anyways.

Ilan, you should learn how to google!!!!
I could have submitted 1 graph, but couldn't find the 2nd. So I figured, they'll know I googled and I left them out.
One bad thing about googling, you get the answer but still need to figure out how to achieve it, else you're stuck at exam time.

Reanie Wrote:
-------------------------------------------------------

> One bad thing about googling, you get the answer
> but still need to figure out how to achieve it,
> else you're stuck at exam time.


Indeed. I use websites a lot for extra reference though. Especially wikipedia when looking for CompSci stuff. I've noticed that some of the algorithms' explanations are almost straight out of Artificial Intelligence: A Modern Approach, so in those cases it only help for external links :p