This is a randomization and local search problem. You are managing a conference in the vast city of Fingerville which is 200 square blocks. Setup your city and then randomly place 20 hotels throughout – using a randomization algorithm. Each hotel only has 15 available rooms.
Next, randomly place 150 conference attendees throughout the city and determine the closest hotel to them that is available.
Output should include a visual / listing / coordinates (or whatever) to define your city. Then should also list each hotel and each guest – inclusive of where each guest started.
Cost of hotel does not have to come into play – just locality and availability.
Important Info: I would prefer if you use Java, but you can use C++, or Python as well. This code is best that you use an array and use Manhattan formula to calculate distance.
Delivering a high-quality product at a reasonable price is not enough anymore.
That’s why we have developed 5 beneficial guarantees that will make your experience with our service enjoyable, easy, and safe.
You have to be 100% sure of the quality of your product to give a money-back guarantee. This describes us perfectly. Make sure that this guarantee is totally transparent.Read more
Each paper is composed from scratch, according to your instructions. It is then checked by our plagiarism-detection software. There is no gap where plagiarism could squeeze in.Read more
Thanks to our free revisions, there is no way for you to be unsatisfied. We will work on your paper until you are completely happy with the result.Read more
Your email is safe, as we store it according to international data protection rules. Your bank details are secure, as we use only reliable payment systems.Read more
By sending us your money, you buy the service we provide. Check out our terms and conditions if you prefer business talks to be laid out in official language.Read more