I know of a couple. One was outlined in the old book "test tube chess" by A.J. Roycroft. The book is about chess puzzle creation and solving, but the golden nugget in the book for calculation is his "iterative process" which is why I named the thread after it.
The popular way is to use a set of "candidate moves." You can find that method in several books as well, but you'll find quite a bit of reading on it just by using google.



Mr. Crow asked this question:
"I have a question. When playing turn based online chess its easy to have an effective check-list to avoid miatakes. but thats pretty time consuming, how do you transfer that to a timed game?"