Im working on a chess engine written in C++. I have alot of it done, but there are functions that are not done yet. Mainly the is_check functions that check for kings in check. I have an algorithm that will search for 20 ply moves deep in 1 minute! Thats pretty fast. The Algorithm is weak compaired to normal chess engines, but the quicker depth searches will make up for it. If you are interested in helping me, and you have chess programming knowledge, then give me an email, [email protected]
Thanks!