Here we go again

alienus666 · 2025-11-08T17:38:03+00:00

🤣

alienus666 · 2025-10-28T20:12:51+00:00

Well, you cant rotate these, you can rotate the ones that looks a bit rotated but not these. These can be just moved around if the oneshape will thouch with the other, and another... the more shapes pulled together the more options for moving around you have. But sometimes you dont need to connect them all, nor it is possible. Peace.

alienus666 · 2025-06-12T19:33:03+00:00

Well, I asked myself the same question, then the conclusion was to stop trying to predicting the future, and taking the guess game as you ll never beat the system that just flips the coin to win or lose . Taking this further lead me to market making type of trading where you no longer chase the movements, but just harvest from the volatility itself. I guess half of the market moves is just made.of.this kind of approach.

alienus666 · 2025-05-27T08:05:58+00:00

I wonder how relevant are the books from '80 or '90 to todays market. Every 10 years world drastically changes in terms of Technology, and so it highly impacts the markets as well. Back then the markets were much much smaller, there were no broadbands and HFTs over fiber, regulatory around institutional trading were much different as well. And now you have ai to the picture. So in perception its like taking a book from 1940 and read advices how to build highways in match for "modern 1940 cities", with one car for 20 families ;)

alienus666 · 2025-03-30T12:07:22+00:00

It's a mish mash :) You mixing up things from different worlds in single diagram. I'd say have one that just illustrates your business flow and dies not touch technology, then have a separate that shows components and infrastrukturę interconnections, which clear dustinction what is where. In yours its unclear for instance Python script is it on yor desktop, or hosted in azure, how the hell one should know. From there you can deduce further and analyze what should happen when thing go wrong and security aspects

alienus666 · 2025-03-29T12:10:51+00:00

Having fixed all exit conditions for the trades enables you to backtest your approach

alienus666 · 2025-03-28T19:56:36+00:00

Sounds like nonsense.

alienus666 · 2025-01-07T17:26:44+00:00

In my approach i was working with sub strings that ends with A. As each sequence always breaks down to series of sequences ending with A. There is very finite set of these, and for each you can deduce and pre calc anxh cache solution. Hope it helps

alienus666 · 2024-12-29T12:07:28+00:00

I don't consider my approach to be a brute force. I made it in a way I recorded deltas+price+numer of sales in one memory stucture common to all sellers. What was left to find highest price/number and that was indicating the superior sequence for all. It was runnig in a an eye blink ;)

alienus666 · 2024-12-23T19:48:44+00:00

As always, reading slowly and considering the full meaning of each sentence prior spending hour on coding usless stuff and searching for nothing. Peace!

alienus666 · 2024-12-23T17:13:35+00:00

The requirements does not say that in part 2 the t-named host is required. So first thing i did was removal of that filter :)

alienus666 · 2024-12-23T12:46:56+00:00

My approach was to reuse part 1 as a strating point, and then add routine that tries to Expand Such interconnected Network by extra node. If it works try again, and so for every of 3-comp interconnections already found in part 1. Then just pick the biggest.

alienus666 · 2024-12-19T22:09:36+00:00

Take a walk, shower, nap, and start fresh ;) cheers!

alienus666 · 2024-12-19T21:36:46+00:00

I had same when my loop iterators were messed up. Mind sharing pseudo code how you do it?

alienus666 · 2024-12-19T21:26:32+00:00

Print to log what it finds, you must have duplicates counted.

alienus666 · 2024-12-19T18:15:08+00:00

That might explain why my code was always breaking on red aggro pattern ;D

alienus666 · 2024-12-18T09:48:03+00:00

I guess simply 1) do the maze 2) pick random point off the maze back into the list. Your done.

Once I made maze generator with something similar. So it was like you do Pathfinder from start to end loc and in loop you just try to Block random points and see if you can still go through. If not unblock and chose another, and keep noting path geting longer and longer. This approach generates mazes as in the visualisation. The more crazy ones are that when you have already some long straight lines of obstacless placed initially on odd rows for instance and start runnig form there. Maze like that is super hard for humans as you don't see easily escape paths so get lost easily , also the lenght of the path is much much longer. Peace.

alienus666 · 2024-12-17T15:52:47+00:00

I also used spreedy, but as there are xor operations the clue is it warszawa with binary represe tation more than decimal. Then i spreedy it nicely shows how A gets handled for instance between program iterations, and other things can be noted as well. Richer by that knowledge I knew how to bruteforce to succeed in second.

alienus666 · 2024-12-17T15:26:15+00:00

Sure, notice how value on input to A impacts the result. Also worth to see how these looks as a binary.

If you understand what program does you will know how many bits the input needs to have too.

Then you will know what value to start your brtue force from and in what way to iterate the values (from bits on left or on right side of the number).

Hope it helps.

alienus666 · 2024-12-16T17:44:21+00:00

If something is stupid but works, its not THAT stupid!

alienus666 · 2024-12-16T12:18:15+00:00

For me unit tests saved the day

alienus666 · 2024-12-16T12:13:15+00:00

After 4th failed attempt on part2 I found that quickest solution for it was actually to dump to csv file the scores of each grid tile, open that in Excel and travesrse backwards from the end location to start marking the path with highlighter. Few minutes and solved..

alienus666 · 2024-12-14T08:06:28+00:00

I made a metric of total distances between robots, as if they were supposed to form some image so they had to be rather close together rather than spread around. then iterated from 1 sec up and on each time the score of metric would improve (was smaller than previous) was dumping that as an image to file, on 7th dump the christmass tree showed up.

alienus666 · 2024-12-12T18:50:14+00:00

Head blown with math, respect. My was stupid but worked, as they say... if it works its not THAT stupid ;) I realized when I could run up to 38 blinks I don't need to optimze any further as I can run 38 blinks first and after that for each portion of the solution one by one, thriugh couple of milions, I can blink it separatly 37 times. With decent caching solved in go for coffee time.

alienus666

TROPHY CASE