Thinning algorithms consist of iterative object reduction steps, which are repeated until stability is reached. In each iteration step, a set of points in the outermost layer of the current object is investigated for possible deletion. In the concept of a k-attempt version of a thinning algorithm, any object point is investigated at most k-times ( \(k = 1, 2,\dots \) ). If a point “survives” the deletion attempts k times, then it is considered as an element of the produced centerline and not investigated anymore. This concept yields a faster thinning approach; however, the result may not be the same as we could get without any limitation of deleting attempts. In this work, we compare a set of existing thinning algorithms without any restriction of deletion attempts and their k-attempt versions. Our aim with this is twofold. We would like to investigate that, what the drawback is in the similarity of the k-attempt version of a thinning algorithm regarding the original one. On the other hand, if the k-attempt version of a thinning algorithm produces the same result as the original set of objects, then it is worth investigating the proof in further work.