Difference b/w Hill climbing and Beam search for #beam = 1

Question

If we consider beam search with just 1 beam will be similar to hill climbing or is there some other difference? As per definition of beam search, it keeps track of k best states in a hill-climbing algorithm.so if k = 1, we should have a regular hill climber.

But i was asked the difference b/w them in a test so I am confused.

score 1 · Answer 1 · answered Oct 22 '15 at 10:32

1

I am on your side here - hill climbing is beam search with beam size 1.

answered Oct 22 '15 at 10:32

Ivaylo Strandjev

69,226
18
123
176

score -1 · Answer 2 · answered Mar 20 '16 at 07:35

-1

Beam search will not stuck in local max or local min position but hill climbing will stuck at local max or local min node

answered Mar 20 '16 at 07:35

Muahmmad Umar Farooq

1

Difference b/w Hill climbing and Beam search for #beam = 1

2 Answers2