The Admitted Shortcut: Tree search over sub-specifications of a decidable logic — shortcuts under a decided, bound admission record, controlled change of the tables they read, and a forward shortcut with a decided margin, with Tau Chess as the worked example
A search program saves work by shortcuts that stop a loop over candidates, or skip a candidate, where the choice cannot change. In the method described here the work of a search is spread over small sub-specifications of a logic with a decision procedure, and a shortcut acts only if a statement about its executed text,...
Taumorrow
· Zenodo (CERN European Organi... · 1 citation