We have a list of twelve 12 digit map references with a Lee distance given from each to a unknown target map reference. As we are working in decimal the Lee distance therefore has a Q of 10. Imagine therefore a Q digit clock face with numbers from 0 – 9. The Lee distance is the shortest distance from one number to another on this clock face. For example, 1 to 4 has a Lee distance of 3 (clockwise) and 1 to 8 has a Lee distance of 3 (anticlockwise). I need to find the target map reference(s) (there may be more than one) that match with the Lee distance from the 12 numbers given. So this is not a complex problem but one that involves a lot of number crunching. You will need to find all the possible solutions for each of the 12 numbers and then find which answer(s) are common to all 12. Can anyone help?
5 freelancers are bidding on average £97 for this job
Hi there! I am able to do that. Please contact me for details. Regards, Valentin Relevant Skills and Experience algorithm Proposed Milestones £55 GBP - flexible
Thanks for your kind watching. I read your descriptions. I thinks to fix your requirements, some algorithmic solutions will be required. So if u hire me, i will do my best to found the best solutions. thanks.