I'm intrigued at the determination in what you are doing here, @Billal50.

First off, let's see how many possible combinations you can have in an 8x8 field with 16-colors.

Calculated.

There are :

115,792,089,237,316,195,423,570,985,008,687,907,853,269,984,665,640,564,039,457,584,007,913,129,639,936

possible combinations for the pixels to appear with only one being the JELPI.

What you MIGHT do is search for a B&W of it to have a greater chance. Here, let me see ...

	[8x8]

Now in searching for THIS image staying only with B&W dots the number gets a bit smaller:

18,446,744,073,709,551,616

So there are that many possibilities of pixels to appear with only one being the B&W JELPI.

Still. You are using FLIP() every cycle. Let's add a keystroke that skips FLIP() to make your program run top speed in its search for JELPI.

Here, try this. Hold (O) to skip the FLIP(). That is your code running flat out.

wofoniyeko

by dw817

Cart #wofoniyeko-0 | 2021-12-13 | Code ▽ | Embed ▽ | No License

1

@dw817 yeah thanks,i already did the math ,it's was just a joke , i used flip() to show every generated sprite every frame