fastest extended tower of henoi

This is extended version of Tower Of Hanoi. in original TOH there are 3 parameters, disks-towers-move one disk at a time. In my problem there will be n number of towers, x number of disks, 1 tower can store max y disks and we can move more than 1 disk upto y disks together. Note we are not changing the disk storage tule (larger disk will be at bottom).

For example:

Total 6 towers, 4 are having total 21 disks 3,6,8,4 respectively and 2 towers are empty.

Tower 1 has: B, A, C

Tower 2 has: A, C, F, D, D, B

Tower 3 has: F, E, E, F, B, A, C, D

Tower 4 has: C, D, C, D

Output:

Any Tower (1 to 6): F, F, F

Any Tower (1 to 6): E, E

Any Tower (1 to 6): D, D, D, D, D

Any Tower (1 to 6): C, C, C, C, C

Any Tower (1 to 6): B, B, B

Any Tower (1 to 6): A, A, A

Each tower can hold max 8 disks.

We can move 1or more than 1 upto max 8 disks at a time.

Notes:

1. You can choose any programming language. Java is preferable.

2. We will test this n number towers, x number of disks, 1 tower can store max y disks and we can move more than 1 disk upto y disks together

A document with flowchart is must.

Matematika Algoritma

ID Proyek: #25120727

Tentang proyek