SSoelvsten / bdd-benchmark

Benchmarking Suite for BDD packages

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

Knight's Tour: Encode Hamiltonian constraint in Transition relation

SSoelvsten opened this issue · comments

With #27 we have the Knight's Tour. The Hamiltonian constraint can be placed directly inside of the transition function by having N2 chains; each chain skips a specific (i,j) on the board for all time steps t. This halves the number of intersections