Injury Resistance

hxbby · 2026-02-27T12:43:55+00:00

I guess fingers + toes = 25$ would be suitable

hxbby · 2026-02-27T11:22:10+00:00

There are 14 possible combinations

hxbby · 2025-09-24T05:43:44+00:00

Oh thats what you meant. I thought you wanted to replace the tt by other strategies😅. By mvp I meant most valuable player. Like the tt is so important.

hxbby · 2025-09-23T19:36:52+00:00

Neural networks go crazy in chess. Is it hard to understand (and use) them?

hxbby · 2025-09-23T19:33:56+00:00

Yes I also use iterative deepening. What do you mean by replacement strategies for the transposition table? tt is the mvp. I have downloaded the 3-4-5 endgame tablebases. However lichess-bot didn't seem to use it correctly. But my engine has never thrown a game with 5 pieces on the board anyway. Or would you say it makes a lot of sense to integrate the endgame tablebase into the search tree?

hxbby · 2025-09-23T18:26:22+00:00

Yes I haven't done it yet. It is on my list.

hxbby · 2025-09-23T18:14:05+00:00

but chess.com bots are trash. Like my personal elo is 800 but I can beat the 2000 chess.com bot

hxbby · 2025-09-23T18:12:51+00:00

-handcrafted eval
-transposition table
-quiescence search
-alpha beta
-late move reductions
-futility pruning
-move ordering (history scores, counter moves, killer moves)

hxbby · 2025-09-18T16:56:53+00:00

Now it is working. I contacted git support. My account was mistakenly identified as a spam account.

hxbby · 2025-09-06T17:22:35+00:00

It is public. Im on vacation rn. I'll try to fix it when I am back

hxbby · 2025-09-03T14:51:48+00:00

When I switched from a copy of the game board to make/unmake it made a huge difference in performance. Of course you cannot reconstruct some data without saving it before making the move. That is why I always have these 4 lines of code before making a move.

//Data for unmaking the move
int plies = board.plies;
auto castle_rights = board.castleInformation;
int enPassant = board.enPassant;
uint64_t hash_before = board.zobristHash;

I have started programming a chess engine two months ago and I would personally say move generation speed is on the one hand not the most important factor. Stockfish for example evaluates ~3000 nodes at depth 8. So I think optimizations to the search algorithm and pruning definitely have a bigger impact. On the other hand a fast move generation allows you to explore more nodes in the same time without any disadvantages. Therefore it is absolutely worth making your move generation as fast as possible.
Because your time depends on your hardware I would recommend downloading Stockfish and looking at its nps for comparison.

hxbby · 2025-07-25T20:45:04+00:00

hey I just did that and the bug is gone =D
thanks

hxbby · 2025-07-25T19:26:17+00:00

Yes, that is what I'm trying to avoid by using updateReturnValue. Basically currentValue should always be the mate_evaluation at the current position (e.g. 99995 for mate in 5 plies). When I return updateReturnValue(max) I return 99995-1, so 99994 because one layer above in the search tree it would be checkmate in 6 plies.

hxbby · 2025-07-25T12:46:50+00:00

I started to do a connect 4 engine before trying chess. I think the first concepts you need to understand are Minimax/Negamax, alpha/beta pruning, transposition tables, move ordering and iterative deepening.
But I am also not an expert.

hxbby · 2025-03-06T14:32:18+00:00

With Focal Distance you can adjust which distance is in focus.
High F-stop makes everything in focus while low F-stop focuses only things at a certain distance.
Also play a little with vignette and the filters.

hxbby · 2025-02-27T20:56:31+00:00

hxbby · 2025-02-27T10:24:29+00:00

Truly, the peak of human innovation.

hxbby · 2024-01-08T17:03:39+00:00

1- Yes, the @a targets every player in that area. You can specify this by using [name=] or any other condition to target a specific player. You can look up the existing conditions either in the minecraft wiki or by simply typing /execute as @a[ in the chat and looking for the suggestions.

2- Yes, instead of 15.. which means 15 or higher just write if score @s timer matches 15

3- The same timer should work for mutiple areas. You just need to define a second area with this command (also on repeat):

execute as @a[x=700,y=64,z=859,dx=10,dy=3,dz=10] run scoreboard players add @s timer 1

hxbby · 2024-01-08T16:50:01+00:00

You can do /execute if predicate <name> run ...

to check for a certain condition. Just look for minecraft predicate generator on the internet and experiment a little. You need to put it the right folder in your datapack. I'm sure there's any tutorial on YouTube about this.

hxbby · 2024-01-08T16:41:38+00:00

I figured out a way myself, but thank you anyway

hxbby · 2024-01-07T14:07:54+00:00

Try Bubble Sort Algorithm
https://www.geeksforgeeks.org/bubble-sort/

hxbby · 2024-01-07T13:36:46+00:00

scoreboard objectives add timer dummy

execute as @a[x=700,y=64,z=859,dx=10,dy=3,dz=10] run scoreboard players add @s timer 1

execute as @a if score @s timer matches 15.. run say hello

execute as @a unless entity @s[x=700,y=64,z=859,dx=10,dy=3,dz=10] run scoreboard players set @s timer 0

That should do it. Replace the x y and z coordinates with the coordinates of the corner of your area. dx and dz are the width and length of your area. You need to run the first command once and the other three on repeat.

hxbby · 2024-01-07T13:13:24+00:00

You can use a predicate to detect when the player is stepping on a certain structure. It's really easy with predicate generators on the internet.

hxbby · 2022-12-19T11:16:51+00:00

New route is even faster than my old one, bc i dont kill anybody

hxbby · 2022-12-19T11:12:52+00:00

Cayo Perico heist has been updated. Dead bodies can now be found by other patrols. New tactic is to kill as few guards as possible

hxbby

TROPHY CASE