This repository contains all the materials and documentation related to my experiences and projects in the Computational Intelligence course. As a student, I was deeply engaged with the course material, which explored various techniques and approaches for creating intelligent systems.
I looked at your code and I am really surprised. You've adopted a really good way of solving the problem, and it's certainly an inspiration to me as well.
The way of finding the cost for the various steps is perfect and I think it also works very well and it shows by the fact that the solutions with N=5 and N=10 are very good. The process also seems quite scalable since you managed to find solutions even for high values of N (where you find the solutions better than mine). The idea of starting with the list with the largest number of elements I think is a good one given your choice of weight. What's more, the code is written in a few lines and this certainly helps to understand the process that leads you to find the solution, perhaps at the limit I would have added a couple more comments. I also tried running your code together with the debugger and indeed the times are very short. You don't always find the optimal solution, but I think it is the best compromise between speed and optimal. I think the one you implemented is the best greedy solution I can think of. The weight should be what allows us to get as close as possible to the optimum.
Wow
I looked at your code and I am really surprised. You've adopted a really good way of solving the problem, and it's certainly an inspiration to me as well. The way of finding the cost for the various steps is perfect and I think it also works very well and it shows by the fact that the solutions with N=5 and N=10 are very good. The process also seems quite scalable since you managed to find solutions even for high values of N (where you find the solutions better than mine). The idea of starting with the list with the largest number of elements I think is a good one given your choice of weight. What's more, the code is written in a few lines and this certainly helps to understand the process that leads you to find the solution, perhaps at the limit I would have added a couple more comments. I also tried running your code together with the debugger and indeed the times are very short. You don't always find the optimal solution, but I think it is the best compromise between speed and optimal. I think the one you implemented is the best greedy solution I can think of. The weight should be what allows us to get as close as possible to the optimum.