By using this site, you agree to our Privacy Policy and our Terms of Use. Close

I can't believe I'm reading such nonsense.

Really Kwaad, I didn't need any proof you don't know what you're talking about, but this shows pretty well what I meant.  I will answer your question right away : it doesn't take even 1% of the power of an P4 2.8 GHz CPU to run your stupid AI. The SNES could run all the AI you talk about.

You don't understand at all what AI is.

Fibonacci is a well known suite, and has nothing to do at all with AI. Man, these are things people learn in first classes of CS (if not before) ! To add insult to injury, the code you put out is NOT a script, as C is no script, it's NOT C++ either, it's badly copy-pasted (evidenced by the lone #include), it's badly written too (a stupid optimization is tried, which doesn't make sense at all, and can only slow the algorithm).

 

And no, AI doesn't run o(e^n), that's nonsense. AI at worst should run o(n log n). Most of the work your computer does in those game you talk about, is not spent in AI. A Chess or Go program will take time trying to play, because it does brute force, not a game AI.  Notice I said a program, not AI, for Chess and Go. Because basically, you make the mistake of mixing AI with programs that are there to resolve problems (Chess, Fibonacci are not AI). Well, Chess programs can become AI, as they can be written so that they take some semi-arbitrary decisions, to reduce an exponential algorithm into a o(n log n) or o(n) one.