I am writing a programme which has to find specific cells with special properties. I don’t know where the cell are located by I have a pretty good idea so my programme can actually make qualified guesses. When I have guessed on a cell and it’s not the right one I have to check the cells lying beside it until I find the right cell. With help from a propagating sphere I have made a vector which solved the problem but I was wondering if one can make some kind of spiral algorithm. To explain what I mean I have made an example of an identical problem in two dimensions - this is seen in the drawing.(adsbygoogle = window.adsbygoogle || []).push({});

First I guess on some cell (start) and then I search all nearby cells one by one until I find the specific cell (end). To the right of the drawing you see the algorithm I could use, I just have to scale it the right way a loop.

Can I extent this idea to 3dimensions? If not, can you proof why? My guess is that the answer lies in graph theory – I just don’t know much about that..

/Peter

**Physics Forums - The Fusion of Science and Community**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Search algorithm

Loading...

Similar Threads - Search algorithm | Date |
---|---|

B Non-algorithmic math | Oct 13, 2017 |

Hypotenuse as required | Feb 21, 2016 |

Info Request: "Latex Search Engine"? | Oct 31, 2015 |

(Potential massive search-space) Is this an exponential problem? | Mar 19, 2014 |

Need sources to search for gamma function infinite series identities. | Feb 27, 2014 |

**Physics Forums - The Fusion of Science and Community**