Re: [Dev-C++] greedy and hill climbing

[Per W. <pw...@ia...>]

Sorry, you have to generate your permutation yourself.

Depending on how you generate your permutations, you can calculate where a
specific permutation should be stored in the array.

There will be a total of 8! or 40320 permutations. Depending on algorithm
implementation, the permutations may also be stored as a large bit array,
where non-eliminated permutations are located by scanning the bit array
32-bit at a time.

/Per W

On Fri, 12 Aug 2005, Pablo Itaim A. wrote:

> Hi, i'm trying to implemet a hill climbing algorithm with a greedy initial heuristic for the n queen problem.
> For the greedy, i wanto to have an array with all the permuted columns.
> is there any c command for genering permuted arrays?
> how can i eliminate a value from that array without searching the complete array?
>
> Thank you for the help and i hope that you can undertand my english ;-)
>
> Pablo