RE: A82: Chess = 1-player vs. TI-8X
[Prev][Next][Index][Thread]
RE: A82: Chess = 1-player vs. TI-8X
The deal with that is that most good chess engines use books to store common openings and the like. If you want it to go in cold each time, then it has to have a very strong analytical engine.
Christopher Kalos
raptorone@geocities.com
raptor_one@hotmail.com
Executive Director/Administrator
Virtual Technologies Developer's Group
----------
From: ilya winham[SMTP:ilyamojo@geocities.com]
Sent: Tuesday, October 28, 1997 11:09 PM
To: CALC-TI@LISTS.PPP.TI.COM; assembly-82@lists.ticalc.org; ti-basic@lists.ticalc.org
Subject: A82: Chess = 1-player vs. TI-8X
I am very curios on how a fairly good AI could be made for a chess game.
I was looking at the old archive of Calc-ti mail's and noticed that a
big discussion started from this type of programming challenge. Some
said, "can't be done", others, "would be too big and slow", yet some
others said' "It has, and can be done using little memory and still be
fast" which they gave example of the HP's and said 1 has already been
written for them. So, it is safe to believe that it can be done, after
all, checkers, (by Frank Force) is a 1-player vs. TI-82 game and the
computer is pretty hard to beat, fast, and the game is small. So if
someone were to figure out how that was done and build on it, an AI for
chess could be written. I am willing to try but need more information on
how to program AI. I have made many programs and games but none have had
a computer AI. I have the skills but not the knowledge to do so yet.
Basically, what logarithm would work? Please, contribute your
thoughts....
- Warning
- Could not process part with given Content-Type:
application/ms-tnef