# Beehive Problem

Page 1 of 1

## 3 Replies - 396 Views - Last Post: 09 October 2012 - 07:22 AMRate Topic: //<![CDATA[ rating = new ipb.rating( 'topic_rate_', { url: 'http://www.dreamincode.net/forums/index.php?app=forums&module=ajax&section=topics&do=rateTopic&t=294889&amp;s=b7ece46f901be0a41c23c37c213b2a71&md5check=' + ipb.vars['secure_hash'], cur_rating: 0, rated: 0, allow_rate: 0, multi_rate: 1, show_rate_text: true } ); //]]>

### #1 Reycharles

Reputation: 0
• Posts: 2
• Joined: 09-October 12

# Beehive Problem

Posted 09 October 2012 - 07:11 AM

I have searched Google for this kind of Problem. BeeHive Problem that is to find the shortest path between the 2 arbitrary cells. What I just found is ONLY this: http://synlapse.com/...ab/bee-sol.html

Does anyone have any other sources? OR does anyone already solve it using java?
Is This A Good Question/Topic? 0

## Replies To: Beehive Problem

### #2 macosxnerd101

• Games, Graphs, and Auctions

Reputation: 11135
• Posts: 41,812
• Joined: 27-December 08

## Re: Beehive Problem

Posted 09 October 2012 - 07:15 AM

Are you familiar with Dijkstra's or the A* algorithms?

### #3 Reycharles

Reputation: 0
• Posts: 2
• Joined: 09-October 12

## Re: Beehive Problem

Posted 09 October 2012 - 07:21 AM

Is that a question?

Yes, Dijkstra Algo is familiar.

### #4 macosxnerd101

• Games, Graphs, and Auctions

Reputation: 11135
• Posts: 41,812
• Joined: 27-December 08

## Re: Beehive Problem

Posted 09 October 2012 - 07:22 AM

That's a nudge in the right direction.