Revision 4480e4ae495ca64f7518dbd8993a991e101f2cca authored by utsa-saga on 07 February 2021, 00:09:30 UTC, committed by GitHub on 07 February 2021, 00:09:30 UTC
1 parent 68925e2
README.md
# vc8proof
This program is intend to show that there does not exist a candidate ordering that is realizable in limited visibility terrain of size 8.
How to execute:
cd Unsolved/
g++ generatecases.cpp -o generatecases
./generatecases
cd ../Solver/
chmod +x ./solve.sh
./solve.sh
Note that ./solve.sh will create 23 processes to verify all 9 * 10 * 11 * 12 = 11880 cases.
Computing file changes ...
