  We describe computer searches that prove the graph reconstruction conjecture
for graphs with up to 13 vertices and some limited classes on larger sizes. We
also investigate the reconstructability of tournaments up to 13 vertices and
posets up to 13 points. In all cases, our proofs also apply to the set
reconstruction problem that uses the isomorph-reduced deck.
