University of Twente Student Theses
Comparing algorithms for the cow-path problem with a non-optimal seeker
Maduro, G.G.L. (2018) Comparing algorithms for the cow-path problem with a non-optimal seeker.
|
PDF
360kB |
| Abstract: | A cow is situated on the origin of a line looking for her favourite food, which is growing somewhere on this line. Unfortunately the cow does not know how far away the food is and if it is either located on her left or right side. So she starts zigzagging in order to find the food, at the same time ensuring that the total travelled distance is bounded by some fixed ratio r times the closest distance to the food. It is known that r = 9, but what happens tot his ratio if she can walk past the food with a probability p>0? Different algorithms will be compared to solve the previous sketched scenario, looking for a minimum ratio r. |
| Item Type: | Essay (Master) |
| Faculty: | EEMCS: Electrical Engineering, Mathematics and Computer Science |
| Subject: | 31 mathematics |
| Programme: | Science Education and Communication MSc (60708) |
| Link to this item: | https://purl.utwente.nl/essays/74889 |
| Export this item as: | BibTeX EndNote HTML Citation Reference Manager |
Show download statistics for this publication
Show download statistics for this publicationRepository Staff Only: item control page