Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Is there a way of finding out goal state from n! different permutations if i dont have any extra information.
The problem i am facing is that i have n objects that are identical and one of there permutation is my goal state. So i want to know is there is any way that i cam do it better than using the brute force approach.
Thanks
So, you have function like f: permutation->bool that has only one true value and you know nothing more about it? I believe what you are facing is indeed brute force.
It’s like finding the null of a black box function. Guess the number I’m thinking of without any hints. You have to say anyone of them.