At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.
If I type in these numbers; 0123456789, will it count as trying all of 012, 123, 234, 345, 456, 567, 678, and 789?
Or only 012, 345, 678, 9?
012, 345, 678
Are there any other restrictions? Otherwise, I don't see how it could be anything but \(10^3\).
well there are 10^3 possible combinations... so you could take 10^3 -1 attempts before you get the successful combination
that is assuming the correct combination is the last 1 entered
then its 9^3 - 1 since only 9 digits
so 728 trials may be needed
minimum is 1 trial as you get it 1st go
Okk .. I would elaborate the question ... I have a three digit combination lock with each digit having 10 possibilities. Once the correct combination is entered the lock opens automatically. How will I optimize my search so as to ensure that I get the combination in the mimimum number of trials. Whst is the minimum number of trials? None of the answers given so far are correct
well you gave us 9 digits 0 to 8
Is this really possible? I mean is there a algorithm for this system which could be faster than the brute force algorithm.