This Challenge is to find maximum size Graceful Graphs via Wichmann Rulers for P>13. This Challenge is related to the Graceful Graph Contest which Rokicki completed in 97 minutes. The Wichmann Conjecture is that no larger solutions exist for P>13.
An Optimal ruler is defined as having end points at 0 and Max with P-2 integer points between [0,Max] such that the distances 1 thru Max exist by deltas between points. An Optimal Wichmann Ruler readily creates solutions that can be tested for number of points and existence of all expected deltas.
The Wichmann difference vector is [Q(1,r), r+1, Q(2r+1,r), Q(4r+3,s), Q(2r+2,r+1), Q(1,r)] where Q(a,b) is b a's, e.g. Q(2,3) is [2 2 2]. The max value is L=4r(r+s+2)+3(s+1) for Points P=4r+s+3, (r and s >=0 and integer).
For W(r,s), W(2,3) creates the difference sequence [1 1 3 5 5 11 11 11 6 6 6 1 1]. The points on the ruler are the cumsum of W with a zero pre-pended to produce S=[0 1 2 5 10 15 26 37 48 54 60 66 67 68], P=14. All deltas from 1 thru 68 can be realized.
Input: P (Number of Points on the ruler)
Output: S (Vector of length P of locations on the ruler, 0 thru Max Value and can generate all deltas 1:S(end))
1) A W(r,s) does not guarantee all deltas can be generated 2) For any P there are multiple W(r,s) solutions 3) P=5 solution is 9, readily solved by brute force 4) P=13 Wichmann is 57 but the best solution is 58. Too big for brute force 5) Create Connectivity Graph for Cases, like Final Matlab Competition, for Fun