Challenge: sum of squares. Let's break 299
|
01-25-2018, 01:55 AM
Post: #39
|
|||
|
|||
RE: Challenge: sum of squares. Let's break 299
The scoring function is simply the count of the edge list:
Code:
{1: {3, 8, 15, 24}, -> 4 2: {7, 14, 23}, -> 3 8: {1, 17}, -> 2 18: {7}, -> 1 } Then, starting with the bare edge list (each of length 2) I extend them 1 character at a time, sorting the results by MINIMUM score. Code:
(I've added some stuff in here to make it run faster by limiting the choices available at different times, but the basic concept is still in there.) Where the extend function only allows it to grow if there are valid solutions: Code:
Then I check to see if there is a tuple of length equal to the goal length and quit. Code:
17bii | 32s | 32sii | 41c | 41cv | 41cx | 42s | 48g | 48g+ | 48gx | 50g | 30b |
|||
« Next Oldest | Next Newest »
|
User(s) browsing this thread: 1 Guest(s)