Thread: what kind of tree is used in chess?

binary tree,octtree?
16 chess pieces at the beginning a double oct-tree?
so if it is octtree is there a way to make it multithreaded to speed up recursive up and down going thru moves(tree),by let each thread wander up and down in left/right parts with two threads simultanously?
the old code I seen is wander up and down in a tree,similar a human mind looks ahead on moves and calculates wins and losses of chess pieces,pawn to queen use the normal values,Kings set value as high as possible so it appears as infinite

Neither. Those would have too few nodes. What you need is a tree with somewhere around 20 sub-nodes for each node.

Oh, you mean like a way to parallelize the possibilities? Sure, you could hand out the available top nodes to different threads, and synchronize them after every player move.

Storing every possible move at each level rapidly becomes impractical.

Consider Alpha–beta pruning - Wikipedia

Originally Posted by ordak

You may ask your questions from this forum. There are many chess coders to help. see the "programming and technical discussions" sub-forum.

thanks,it looks very interesting
wonder maybe a simplest chess engine,might probably be flawed in endgame,not avoiding stalemate
also thanks greaper,salem

Originally Posted by ordak

Chess programming wiki.

TSCP.

thanks,so I start with make chess board+various arrays under it that keeps track of chess pieces and such