Minimax Chess Programming

For a science project, I'm writing a chess program using the Visual Basic 6.0 program. It's going to use a minimax search to try and search out superiorites in a board position. I'm testing various "schools of play" to find out which one is the "best" according to my program.

But...

Although I know all of the concepts behind minimax, and I know a heck of a lot about chess, I'm still at something of a loss as how to actually go about programming it. I have an advisor to help me, but still, any advice that anyone here might have would be much appreciated

Thanks

 

Log in or Sign up to hide all adverts.

Perhaps have it check through all 1-move wins first, to see if any are appropriate; then all possible 2-move wins; then all possible 3-move wins; and so on. This will keep the processing time shortest while searching through the moves required for each win.

 

Log in or Sign up to hide all adverts.