For future VIP candidates curious to explore the visualisation side of constraint programming problems, an accessible way to start and contribute to the existing library would be to tackle the following CSPLib problems:
[ ] Problem 012: Nonograms
[ ] Problem 015: Schur’s Lemma
[ ] Van Der Waerden Numbers (similar to Langford)
These are all well-defined and easy theory, with some obvious visualisations available. They would also be a good way for new VIP students to explore Conjure.
For future VIP candidates curious to explore the visualisation side of constraint programming problems, an accessible way to start and contribute to the existing library would be to tackle the following CSPLib problems:
[ ] Problem 012: Nonograms
[ ] Problem 015: Schur’s Lemma
[ ] Van Der Waerden Numbers (similar to Langford)
These are all well-defined and easy theory, with some obvious visualisations available. They would also be a good way for new VIP students to explore Conjure.