Hi all,
I'm trying to solve a problem involving maximal clique. If there is a
better solution than brute force, please let me know..
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to
Hello!
I'd like to present my solution to the problem introduced in the
topic. First thing first, the detailed definition is in place :
Given the set of integers S = {e_1,e_2 , ... e_n } find (count) all
subsets S_n of S so, that sum(S_n) = N, for a given integer N.
After thinking a bit about t
> I hope there is no specified order of distribution of the disks in the
> three towers except that they ARE indeed, ordered (a smaller disk
> restts on a bigger disk)
>
> Let us keep track of the sorted pile, initially sorted_pile =
> and it'll be be on top of one of the towers.
>
> Every time,
try to solve the problem backwards from the solved state.
assume that all of them are sorted in tower C (the solved state.)
now you're to move them to reach the initial position.
so first try to move the biggest ring into it's place [in the initial pos.]
then second ring and so on.
the reverse o
