Post History
Answer
#3: Post edited
Firstly, gracias for the answer.What kind of *additional information* would be required? Is there some way to reduce the number of steps (the lost object *is* in one of the $4$ squares) to discovery of the lost object?How about if I *randomly* (???) sweep sections of the $3$ squares left. Divide the $3$ remaining squares into equal parts and conduct variable searches in these parts. For example I now subdivide each of the remaining $3$ squares into thirds, giving us a total of $9$ smaller rectangles. After that I could *vary* (advisable?) how many of the rectangles/square I search: I could search $2$ of the rectangles in one square, $1$ each for the other $2$ squares. Does this "technique" reduce the number of steps relative to the brute search method we were using?- ![Like this](https://math.codidact.com/uploads/n360q6fg2erisd6u3oxj2z6hcdjd)
- ![Like this](https://math.codidact.com/uploads/n360q6fg2erisd6u3oxj2z6hcdjd)
#1: Initial revision
Firstly, gracias for the answer. What kind of *additional information* would be required? Is there some way to reduce the number of steps (the lost object *is* in one of the $4$ squares) to discovery of the lost object? How about if I *randomly* (???) sweep sections of the $3$ squares left. Divide the $3$ remaining squares into equal parts and conduct variable searches in these parts. For example I now subdivide each of the remaining $3$ squares into thirds, giving us a total of $9$ smaller rectangles. After that I could *vary* (advisable?) how many of the rectangles/square I search: I could search $2$ of the rectangles in one square, $1$ each for the other $2$ squares. Does this "technique" reduce the number of steps relative to the brute search method we were using? ![Like this](https://math.codidact.com/uploads/n360q6fg2erisd6u3oxj2z6hcdjd)