29 pts ยท December 6, 2012
booty booty booty rockin' everywhere
Sounds like a good way to scrape your dick on the edge
Looks good!
That's... that's sex. Close
No, just didn't spend much of any time with dogs. Most of my relatives had cats or no pets.
Snowboard kids!!!
Ya, this is breadth first search. Except it probably is just flood fill and not a search algorithm. Still fun to think about, though.
Which algorithm is it using for flood fill?
Could you please elaborate on how your flood fill works that it wouldn't need some kind of loop or recursion?
Although, using the ideas of breadth first, a bidirectional search is a plausible algorithm for a maze. Given it knows the end.
Taking a look at the algorithm for flood fill, it looks like it shares its ideas with search algorithms including stacks and queues.
If you want to use a path finding algorithm to look like this, breadth first search is the way to go.
As long as you are not worried about memory usage. Still better to use a heuristic when possible.
In terms of code, this can easily be handled in a while loop using a queue to hold the new states.
Pretty much any other standard search algorithm. Especially ones with heuristics like A* and Greedy Best First.
She gets all ready, putting her hair up in a bun. Judge's Response: 30 days
Thought the big cat was the dead mother at first
You're right, it looks great! XD
CCCCCHHHHHHHHHHHHHHH
Actually, it's fucking terrifying.
Not if you just ate the Dare Devil Loaded Grillers Ghost Pepper edition.
Kitten: "U WOT M8?!"
booty booty booty rockin' everywhere
Sounds like a good way to scrape your dick on the edge
Looks good!
That's... that's sex. Close
No, just didn't spend much of any time with dogs. Most of my relatives had cats or no pets.
Snowboard kids!!!
Ya, this is breadth first search. Except it probably is just flood fill and not a search algorithm. Still fun to think about, though.
Which algorithm is it using for flood fill?
Could you please elaborate on how your flood fill works that it wouldn't need some kind of loop or recursion?
Although, using the ideas of breadth first, a bidirectional search is a plausible algorithm for a maze. Given it knows the end.
Taking a look at the algorithm for flood fill, it looks like it shares its ideas with search algorithms including stacks and queues.
If you want to use a path finding algorithm to look like this, breadth first search is the way to go.
As long as you are not worried about memory usage. Still better to use a heuristic when possible.
In terms of code, this can easily be handled in a while loop using a queue to hold the new states.
Pretty much any other standard search algorithm. Especially ones with heuristics like A* and Greedy Best First.
She gets all ready, putting her hair up in a bun. Judge's Response: 30 days
Thought the big cat was the dead mother at first
You're right, it looks great! XD
CCCCCHHHHHHHHHHHHHHH
Actually, it's fucking terrifying.
Not if you just ate the Dare Devil Loaded Grillers Ghost Pepper edition.
Kitten: "U WOT M8?!"