Knights Tour Problem 107
Back to Problem Solutions forum
Hey. I am trying to find the most efficent way to solve problem #107. I am using python, with depth first search, which is an interpreted language,
and to speed up my process I am implementing Warnsdorff's rule in addition to limiting number of recursive function calls to 2 000 000,
s for each starting point.I am assuming that in the hinting to Warnsdorff's rule lays the answer to the probelm. Tell me admins, is this a good idea, or should i wait 200 hours in order
for Python to finish looking for all permutation, or change to a complied language? Please give me a hint =) I was also thinking on divide and conquer algorithm
Hello there!
Honestly, I poorly remember solving this myself (but sure it was more than once). Idea of applying the rule is correct, only make sure that you apply it correctly, hm... and correct version of the rule :)
or change to a complied language
I don't think it help :)
It is good to be able to assess the speed of languages. Python is (quite roughly) 10-20 times slower compared to C. But it is a constant factor. Thus if the program takes 1000 years in Python, and 50 years in C - it is virtually no difference :)
I'm thinking of a solution with splitted board. I found a paper where you can have a missing square and still divide the board
into smaller pieces. However I wont do it right now, I am so close to finishing the certificate, and would want to do it asap.
I just got my job offer revoked, and hopefully with this sertificate I get a better chance of finding a job.
BTW Any good webcites for finding a job in Russia? I moved out of St.Petersburg when I was a child, and want come back to work a bit
in Russia. I have used hh.ru, have had s couple of interviews, but no luck yet.
Yes, it seems you have just 4 more tasks left so probably the strategical way is to try other problems. :)
This one is funny, but I'm not sure it is useful - it is too specific :)
I have used hh.ru, have had s couple of interviews, but no luck yet.
Yes, HH is currently the largest and the best. I changed 9 or 10 places since 2008 and every time I was using HH.
Don't hesitate because of "couple interviews". They may be ten or so - but all we need is an offer from one of them. Finding the job for the first time is usually a bit more difficult, but surely not impossible :)
If you feel you may want some help/hints on CV - just tell, I'll try my best. If you want recomendation at linkedin - also just contact me here (and write few words to identify you). I'm not sure it would be of much use, however.
P.S. it may be good to try QA (or automated QA) positions rather than developers - preferably in some outsourcer like DataArt.
Here is my linkedin profile. https://www.linkedin.com/in/christian-gjedrem-bab66a92/ . Thank you very much for your help.
I have a masters in petroleum but got into programming and machine learning lately and I am trying to find a job that
will include both thing. The offer I had, had both...
The offer I had, had both...
What was the company?
One of my previous places EPAM, has special department to grow data-science / big-data developers. My current too, but EPAM in my opinion has better accomodation process (good internal courses etc). Is it something you may be interested in? We can try write them too...
I sent a request for connection in linkedin. It seems I can not recommend the person who is not connected :) Honestly, linkedin is a very strange platform, in my opinion.
and hopefully with this sertificate I get a better chance of finding a job.
Honestly I think that not too many people even heard of CodeAbbey at all, and it is not official educational company... But if I can recommend you personally anywhere - I shall try too :) The person with such devotion to self-eduction obviously deserves attention from employers.