Skip to main content

Browse the archive

https://github.com/utsa-saga/vc8proof
15 November 2021, 16:55:38 UTC
Revision 11b14e0eb8c745f8017d2f12af5286ebc5c638e5 authored by utsa-saga on 19 February 2021, 01:18:59 UTC, committed by GitHub on 19 February 2021, 01:18:59 UTC 
Delete determineGaps.cpp
1 parent 3b2c0da
Raw File
Tip revision: 11b14e0eb8c745f8017d2f12af5286ebc5c638e5 authored by utsa-saga on 19 February 2021, 01:18:59 UTC
Delete determineGaps.cpp
Tip revision: 11b14e0
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.
back to top