Programming help is terrible in assignmentexpert

Www.assignmentexpert.com's Comment

Written on: 06/11/2014

Dear Customer, thank you for providing detailed information in your review. We also appreciate the discreet way of stating the facts.
There might have been a huge misunderstanding. First, please accept our apologies for lateness, as expert really made many efforts to provide prompt updates and instructions for you to understand what was going on in the completed project per each of your requests.
Let us start from the initial task requirements you submitted. The assignment was to create a simulator for a robot travelling through a 15x20 maze with obstacles in it in Java. Our expert has successfully managed to fulfill these features:
• Upon running, the user will be able to choose from three different options: Exploration, Shortest path and Map Description Generator
• In exploration, if there is no time limit nor exploration limit entered, the robot would explore a given map until the entire map has been checked.
• In Map Description Generator, the user is presented with a blank grid, and he could click each grid to toggle it between "Unexplored", "Clear" and "Obstacle". Or he could select the map from exploration. He can then generate a map descriptor from it. (Details in a separate file)
• There are 3 sensors on the robot, one in front and one on each side. The side sensors can be assumed to be able to detect an area of two wide and four long accurately. The front sensor can only sense the obstacle's distance in front, but not whether it is on the left or right. The robot is 2x2 and starts from the center: (7,10)(8,10)(7,11)(8,11) facing up in exploration.
• The front sensor can only sense the obstacle's distance in front, but not whether it is on the left or right.
• The robot will require it's own map which it will update as it explores. For the map, I was thinking white for clear, black for obstacle and grey for unexplored. The robot would be a green circle with a blue triangle marking the direction it's facing. The robot is 2x2 and starts from the center: (7,10)(8,10)(7,11)(8,11) facing up in exploration.
But there was something that was partially done by the expert due to lack of time:
• In shortest path, the user can either upload a completed map or take whatever was found in exploration and find the shortest path from the bottom left to top right.
We do confess that fact absolutely. That is why you had a conversation with the manager and were asked to accept partial refund as soon as expert has strived to assist and most feck of the requirements were implemented.
You claimed that none of the 3 tasks were fully completed. Concerning the first one, there were .pdf and .txt files where you described all the demands, but there was nothing about the specific GUI. Concerning the second one about finding ways, a wave algorithm (Lee algorithm) guaranteed the possibility to find the shortest. Concerning the third one, if you take a close look at the .txt file with requirements, you will learn more about the job itself, that robot should take 4 cells but not 1. Once you have drawn your map, you must run the algorithm for the examination (the second menu item). You received picture proofs from us where the algorithm marked all the cells, as it did not have any information about the barriers or cells which have not been studied yet. In other words, the file was filled with zeros and it means that all cells were empty and available. So naturally, you need to inspect the area first and then look for the shortest path.
You have also received 3 video proofs, we afraid it is not allowed to provide any links here, so everybody could check them out. Anyhow, we will be glad to do that when it is allowed. So the first video shows why your example can not be verified. The task says that pseudo-algorithm study is ready; the expert just needs to write an algorithm to find a way. Research algorithm consists of simple turns on the left and should pass directly. The expert warned you several times about his doubts on the correctness of research algorithms, since it can’t be handled in cyclic spot. Eventually, the expert’s job was to write a search algorithm. Therefore, he also created a map without possible cycles, what is shown on the second video. The third video shows that sometimes there are maps that contain loops, but the robot detects it at the end and it has to find the beginning and the end. If you look at map with the shortest path, you can see the indexes that are assigned to all the cells. Please read carefully about Lee algorithm and you will get how the shortest path algorithm should work. Our expert also recommended you to use algorithm A*, but unfortunately you ignored the matter.
Now, we would like to clarify the situation with PayPal as our payment method and guarantees it gives. Buyers have a right to open dispute or claim if they can’t accept consequences of the disagreement and insist on having it resolved. You as a buyer used that potential by opening a dispute first, where we explained the situation again and suggested 50% partial refund trough PayPal interface which you denied, and by opening a claim soon demanding a full refund. We had to disagree, as it would be an unfair decision to accept a full refund. Thus, we provided all the proofs requested by PayPal and it happened so that they decided in seller’s favor.
Please believe that our staff does struggle for every customer, trying to satisfy all the demands. We really appreciate patience, when there is something Delphic and needs to be modified no matter whose fault. Anyway, you are always welcome to use our services if you face an awkward situation again. Please contact manager to discuss a discount for your next order!