Messages

What is the interpretation of random seeds?  Thanks.

Hii..liviu!
Can you help in knowing that is it possible to create n different timetables from this algorithm?

Thanks a lot Liviu. Will implement this.

Okay. And in 2(d) we were calling A_p,A_q and A_r at Level+1. Difference is in the levels only? Right?

But again. In 2(g). -> A_p or A_q or A_r itself can go to further recursion if there are conflicts in every slot?

//some_code_earlier
Foreach(conflicts to A_i)
{
           while(level!=0)
           {
                   return;
            }
            if(level==0)
            {
                      function(conflict,level);
             }
}
Are you saying something like this?

[And in the last step]

ohh. I am totally lost now I think. Then in step 2(d)-> Were we trying to place (A_p , A_q , A_r)as a whole(simultaneously) and where  A_i already placed.
And in the last step:
We are trying to place for each of A_p, A_q and A_r?
(I know am taking a lot of time to understand, Please clear things a little bit). I have been studying/working on this since a month.

Okay. But in the last step. We unallocate A_p,A_q and A_r and allocated A_i in that slot.Right?
And this time we try to place A_p,A_q and A_r iteratively?Right?
Actually am not that comfortable in C++. Am trying this in PHP.
Thanks for a quick reply.

[>>>> Now A_p and A_q and A_r are not able to place. We will go back to A_i and look for A_i???(is this how it should work)?]

Hii...Can you please help me implementing the last two steps in your algo.I am using in my project work of school. How are last two steps implemented?

2 f) If all (or a reasonable number of) time slots were tried unsuccessfully, return without success.
    >>>> Now A_p and A_q and A_r are not able to place. We will go back to A_i and look for A_i???
(is this how it should work)?

2 g) If we are at level 0, and we had no success in placing A_i, place it like in steps 2 b) and 2 c), but without recursion. We have now 3 - 1 = 2 more activities to place. Go to step 2) (some methods to avoid cycling are used here).
(If A_i is left unplaced. We should place A_p,A_q and A_r iteratively. What if still it not able to place?? And what are other possible things which can be done here?)
Please help ASAP.Thanks in advance.