Limiting the consecutive occurrence

[aGia]

for this problem aGia I would use the combinator. You got the half of your password in one file, the second file you can generate via mp64 or mp32. Combinate them, you still have 2billion combined possibilities, then feed it in to oclHashcat+

2billion you can be run in a few hours at speed of 100,000 c/s.

Of course you can filter them so cut down about 28%.

Thanks for opfer the calculation power. which country is it?

Its Greece, the 2.17b passwords will take me a lot of time. My cpu is amd 1100t black edition its a respectable 6 core cpu ,and my gpu is gtx260 low end graphics card. Combined with cuda pyrit i get 16000 pmk/s so it would take me 37 hours to run it so its rendered useless the whole procedure.
But why do u think my compression after filtering would be only 28% ?
To explain my self better for a 6 digit password i don't think one need so many restrictions like the one's you are planning on an 8 digit scale.
For a 6 digit password low-alpha numeric my strategy would be (if i could program it) no more than one instance of 2 consequtive characters
and no more than 2 instances of two characters appearing for a second time.
i.e. 5ebbd5 would be acceptable but not 55ebbd
any help appreciated, just for the fun of it i love this thread and i dont mean to push anyone or anything