Alpha beta pruning on Iterative deepening

Hello

I am writing a board-game. What I am trying to do is the following: I want to alpha beta prune an iterative deepening tree.

I know how to alpha beta prune. I know the concept of iterative deepening but found no good example. It looks a lot like Breadth-first search on graphs. So my question is: is it possible to create an iterative deepening tree without using an adjacency matrix or adjacency list implementation?

Would love if someone could give me some pseudo code for this.

Thank you

Check out:
Micro-Max

No pseudo code, but he had actual code for it, in C


To ask Muller a question, (or any of the other experts. Sign in (free, and no spam), and ask away:

TalkChess.com :: Index

Also, there are scores of open source C chess programs that use ID DFS, but the talkchess forum is THE place for chess programming advice and yakking.

Thanx alot!

You're quite welcome. Good luck with your game.