There are $N$ balls such that out of these balls only one ball is heavier. We have one balance scale. With it we can know which of two ball groups is heavier. Balls get damaged when weighed, so each ball can take part in a weighing at most $K$ times, where $K \geq 1$. Help find the minimal number of weighings after which we can find the heaviest ball.
Example: If $n = 19, k = 2$, the answer is 3.
Note: Balls cannot be distinguished in terms of appearance.
I know these kind of questions have appeared quite often and their answer is $\lceil log_3(N)\rceil$. But I wonder by restricting $K$ will there be any effect on the answer and why?
Given a number of weighings $K$ the maximum number of balls $N$ is: $$ N = \frac{3^K - 3}{2} $$