I don't know if this helps, but the posts at https://web.archive.org/web/20160329115022/algebraicthunk.net/~dburrows/blog/entry/package-management-sudoku/ and https://web.archive.org/web/20160328001757/http://algebraicthunk.net/~dburrows/blog/entry/package-management-sudoku-2/ might potentially be useful as test cases for algorithmically complex package management situations.
I have bean thinking about doing a sudoku solver. It would be fun.
It'd be an interesting performance test case, and it'd be possible to translate existing puzzles of various difficulties into package management problems of various complexities. (For instance, "problem with no backtracking" vs "problem requiring backtracking".)
Last updated: Oct 21 2021 at 20:03 UTC