CrackMe® Practices for Newbies
PROJECT 6: caveman by Ghiribizzo

Re: file generator...(final)
Thursday, 04-Mar-99 04:24:12

    Hi again,

    I just downloaded your routine and will try to compile and run it. I don't think that there is an algorithm to figure the winning moves from any empty position on the board. The only way to do it is one of three possible ways:
    1: is to have the same checksum number for any name entered which will land you always on the same place thus you have to create only one winning compination of moves. This is my choice.
    2: to create a table of sets of moves to bring you to the smae known position followed by the winning moves from that chosen position. The same number of winning moves can be used every time after the few moves to bring you to the starting point you have chosen. Harder than the first one but doable.
    3: This is the hardest and it requires 46 sets of winning moves one for each possible starting position. It requires lots of time building these needed 46 sets. I have enough trouble with one let alone 46.
    I hope I am making some sence. Good luck and see you next project.

    Best regards,

    Joseph


    Joseph


Message thread:

snakebyte's thread (snakebyte__@hotmail.com) (20-Feb-99 09:08:43)

Back to main board