Alpha beta pruning on Iterative deepening
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.