Skip to content

Conversation

@WPettersson
Copy link
Contributor

No description provided.

There is one Iterator class, which has a pointer to a (polymorphic) base
structure which can do different types of preprocessing.
Don't optimise if preprocessing takes > MAXTIME, which is now #defined
for easier modification.
Also introduces 2 new SkipBig iterators, with steps of sizes 15 and 50.
FindBestIterator loses the guarantee that the last-added position will
be the one this agent considers "worst", so we now keep track of what
the worst rank is.
Finds the best position to add in the current group/rank of the current
agent.
This new mode (7), first runs skip5 until it cannot find anything,
before moving onto the exact algorithm.
reductionExact now takes a supp parameter, defaulting to false. If set
to true, then we also look at positions which are always filled when
looking to find sets C, P, and P'.
@WPettersson WPettersson merged commit 93ff28d into master Oct 30, 2019
@WPettersson WPettersson deleted the preprocess branch October 30, 2019 16:03
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants