PureBasic Forums - English

xorc1zt wrote:

evilgravedigger wrote:

Code: Select all

Global T.f = 19.0
Global A.f

!movq xmm0,qword[v_T]
!sqrtss xmm0,xmm0 
!movq qword[v_A],xmm0
Debug A

requires SSE.

sqrtss return the square root not the cube one.

sse cuberoot : http://www.musicdsp.org/showone.php?id=206

Ow, sorry, my bad.

I solved freezing problem. I just added waitwindowevent(1) to the loop, works like a charm now.

Okay, what I have is a very basic block game, which computer plays with itself :mrgreen:
I have 2 questions about it:

1) How do I remove the bottom line, when it's filled with boxes and move the whole image down, like in tetris?
3) How do i avoid program freezing? When I click the window, program ...

I made this code for the purepuch contest but I can't compile the instructions no more to respect the rules of the contest : 10 lines max.

So, the code of this simple Tetris game contains only 19 complete lines (80 chars per line)

I saw the size of the executable 18.4KB Macro BL(X):For I=0 To 3:X ...

requires SSE.

You need to preserve ebx, edi and esi.
Otherwise it could cause unexpected behaviour.


Procedure.q FNV32(*pdata.i,len)
!push ebx
!push edi
!push esi

!mov esi, [p.p_pdata+12]
!mov ecx, [p.v_len+12]
!mov eax, 2166136261
!mov edi, 0x01000193
!xor ebx, ebx
!ntbyte:
!mov bl, [esi]
!xor eax, ebx ...

The obvious way would be to do the following:
1. Thread starts from 0%
2. Thread starts from 25%
3. Thread starts from 50%
4. Thread starts from 75%

Of course I understand, understand, but how to implement the idea?
1 thread - from AAAA to BBBB
2 thread - from CCCC to DDDD
etc

So if password is ...

Hi there.
I'm coding md5/sha1 CPU bruteforce tool (I know that GPU bruters are million times faster etc, I only code it for learning). My question is mostly about algorithm.
For example, I use 1 thread for bruteforcing passwords from AAAAA to ZZZZZ.
How to use second thread? My idea was - bruteforce ...