Currently, we compute and store each assignment found for each component in an array. We should be able to considerably compress this output by storing a decision tree instead, only storing each guess list once, preferably branching on larger guess lists first. May also be able to use such information to identify other components that are disconnected.
Currently, we compute and store each assignment found for each component in an array. We should be able to considerably compress this output by storing a decision tree instead, only storing each guess list once, preferably branching on larger guess lists first. May also be able to use such information to identify other components that are disconnected.