Proof-number search is an algorithm used to map game trees of two-person perfect-information games to an and–or tree. It assigns proof and disproof numbers to each node, which represent lower bounds on the number of nodes to be evaluated to prove or disprove certain nodes. Variants of this algorithm have been developed to reduce memory requirements.
University of Washington
Spring 2021
University of Washington's course develops rigorous tools to study the meaning of programs. It aims to improve formalism, proof skills, and precision in programming, while also discussing practical applications. It covers operational semantics, Hoare Logic, compiler correctness, and more.
No concepts data
+ 17 more concepts