jkarolczak / google-hashcode-2020

jkarolczak/google-hashcode-2020 Issues

6. "Our Genetic Algorithm mutate each solution, we do not use any probability to determine chance of mutation occurence like in a typicial GP." - Ok, whatever works for you, but in my opinion you shouldn't do it like that. Read about Eigen's threshold, if mutations occur too often, the system will be incapable of retaining any information (in this case - best solutions). Think about it, if you find an almost perfect solution, it won't pass its fitness much further, because it will be destroyed in a few generations.
Closed 3 years ago1
5. Your description lacks the theoretical part, you didn't describe the approached used (only how it was implemented). Why did you choose this one? What were the advantages?
Closed 3 years ago
4. Add your student group to the PDF.
Closed 3 years ago
3. Suggestion: You sort books by their score every time you generate a new solution, which is probably done many, many times. Since the scores are not changing during execution, wouldn't it be better to sort those books only once, at the beginning?
Closed 3 years ago1
2. Line 45, are you sure it shouldn't be greater or equal? If you scan maximum number of books you will still try to add the next one.
Closed 3 years ago
1. You showed fragments of your code, but there is no description of variables. Some of them are pretty complex and I had to guess what is for example "libraries[i][0][1]".
Closed 3 years ago2
complete_solution()
Closed 3 years ago
evaluate_solution()
Closed 3 years ago
get_random_solution()
Closed 3 years ago
get_initial_population()
Closed 3 years ago
get_children()
Closed 3 years ago
get_offspring()
Closed 3 years ago
mutate()
Closed 3 years ago
do_mutations()
Closed 3 years ago
main()
Closed 3 years ago