Continued working on my chess bot. It can solve simple tactics via a very simple piece-value based evaluation strategy.
* Quiescence search: Solution to "what happens if the searching algorithm stops right before I am checkmated?"
* Time-based incremental search: Currently the depth must be given as an argument, and only one search is performed. Incremental search starts with depth 1, then goes to depth 2 with the information learned from the depth 1 search, and so on, until we are out of time.