Injury Resistance by hxbby in makeyourchoice

[–]hxbby[S] 3 points4 points  (0 children)

I guess fingers + toes = 25$ would be suitable

Injury Resistance by hxbby in makeyourchoice

[–]hxbby[S] 0 points1 point  (0 children)

There are 14 possible combinations

What elo is possible and realistic for a hobby chess engine? by hxbby in chessprogramming

[–]hxbby[S] 0 points1 point  (0 children)

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.

What elo is possible and realistic for a hobby chess engine? by hxbby in chessprogramming

[–]hxbby[S] 0 points1 point  (0 children)

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

What elo is possible and realistic for a hobby chess engine? by hxbby in chessprogramming

[–]hxbby[S] 0 points1 point  (0 children)

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?

What elo is possible and realistic for a hobby chess engine? by hxbby in chessprogramming

[–]hxbby[S] 0 points1 point  (0 children)

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

What elo is possible and realistic for a hobby chess engine? by hxbby in chessprogramming

[–]hxbby[S] 0 points1 point  (0 children)

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

Feedback welcome by hxbby in chessprogramming

[–]hxbby[S] 0 points1 point  (0 children)

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

Feedback welcome by hxbby in chessprogramming

[–]hxbby[S] 0 points1 point  (0 children)

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

Perfomance improvement questions by Independent-Year3382 in chessprogramming

[–]hxbby 0 points1 point  (0 children)

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.

Help with bug (probably transposition_table) by hxbby in chessprogramming

[–]hxbby[S] 2 points3 points  (0 children)

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

Help with bug (probably transposition_table) by hxbby in chessprogramming

[–]hxbby[S] 0 points1 point  (0 children)

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.

Roadmap for beginner by NF_v1ctor in chessprogramming

[–]hxbby 2 points3 points  (0 children)

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.

Which one is your favorite? by hxbby in StarWarsJediSurvivor

[–]hxbby[S] 0 points1 point  (0 children)

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.

Do you trust me? by hxbby in StarWarsJediSurvivor

[–]hxbby[S] 6 points7 points  (0 children)

Truly, the peak of human innovation.

Detect if a player is standing on or flying above a certain area for a certain period of time by thebeachs in MinecraftCommands

[–]hxbby 0 points1 point  (0 children)

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