Find Local Maximum in an Integer Sequence

Question

An element of an integer sequence is called a local maximum if it is not smaller than all its neighbors. E.g., all local maximums of the following sequence are bolded.
3, * 4 *, 2, 1, * 3 *, 2, * 8 *, * 8 *, 1, * 4 *
Consider an integer sequence of length 16 whose elements we don't know.
?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?
Find (any) local maximum by revealing at most seven of them.
Try it here: https://bit.ly/localmaximum
Bonus question: how would you implement an adversary strategy such that it is not possible to solve the puzzle in less than seven steps?

Jaap Scherphuis · Accepted Answer

It is possible to solve up to $n=20$ cells using only $m=6$ moves.

In particular, it is not possible to answer the bonus question as stated.

hexomino · Answer

It can be achieved in $7$ reveals as follows

Bonus

happystar · Answer

I found a different answer:

I don't know the answer to the bonus question unfortunately. I'm assuming that

Find Local Maximum in an Integer Sequence

3 Answers

Add your own answers!

Ask a Question