School Assignment? Project Due Tomorrow? Chat LIVE With A Programming Expert!

Welcome to Dream.In.Code
Become an Expert!

Join 300,418 Programmers for FREE! Get instant access to thousands of experts, tutorials, code snippets, and more! There are 1,563 people online right now. Registration is fast and FREE... Join Now!




Local beam simulated annealing hill climbing search

 

Local beam simulated annealing hill climbing search, Artificial machine intelligence

philmetz

7 May, 2009 - 10:26 AM
Post #1

New D.I.C Head
*

Joined: 7 May, 2009
Posts: 1

I have this question:
You are required to implement an agent that performs a specialized version of the local beam simulated annealing hill climbing (k=3).

Just not sure how to do this, can someone help.
My idea is this:
I pick 3 random spots on a map (local beam search)
I then perform hill climbing search on each of them
once i cant find a higher point, i sort of shake the map (simulated annealing) and perform hill climbing again.

Is that right? or how is it done?

User is offlineProfile CardPM
+Quote Post

Fast ReplyReply to this topicStart new topic

Time is now: 11/7/09 11:36PM

Live Help!

Be Social

Dream.In.Code RSS Feed Dream.In.Code LinkedIn Group Follow Us On Twitter Fan Us On Facebook

Tutorials

Programming

Web Development

Reference Sheets

Code Snippets

DIC Chatroom

Bye Bye Ads

Monthly Drawing

Thumb Drive

Top Contributors

Top 10 Kudos This Month