Mater adapted for Free Pascal

Discussion of anything and everything relating to chess playing software and machines.

Moderator: Ras

User avatar
Roland Chastain
Posts: 669
Joined: Sat Jun 08, 2013 10:07 am
Location: France
Full name: Roland Chastain

Re: Mater adapted for Free Pascal

Post by Roland Chastain »

Mater for Free Pascal has a new home page.

I polished a bit the whole project (without essential modification) and made binaries for Linux and Windows.
Qui trop embrasse mal étreint.
Alexlaw1964
Posts: 5
Joined: Fri Jan 03, 2025 6:36 am
Full name: alex lobov

Re: Mater adapted for Free Pascal

Post by Alexlaw1964 »

Hello.
My algorithm for solving chess problems.
Image
Alexlaw1964
Posts: 5
Joined: Fri Jan 03, 2025 6:36 am
Full name: alex lobov

Re: Mater adapted for Free Pascal

Post by Alexlaw1964 »

Image
Alexlaw1964
Posts: 5
Joined: Fri Jan 03, 2025 6:36 am
Full name: alex lobov

Re: Mater adapted for Free Pascal

Post by Alexlaw1964 »

Image
Alexlaw1964
Posts: 5
Joined: Fri Jan 03, 2025 6:36 am
Full name: alex lobov

Re: Mater adapted for Free Pascal

Post by Alexlaw1964 »

Alexlaw1964
Posts: 5
Joined: Fri Jan 03, 2025 6:36 am
Full name: alex lobov

Re: Mater adapted for Free Pascal

Post by Alexlaw1964 »

With the transposition table, the number of nodes viewed will be significantly reduced.
I don't use transposition tables.
[d]8/1p6/7B/4p3/4k1P1/5n2/1P3PB1/K2R4 w - - 0 1 mate 4 moves
In this position, after the moves:
1. h6-c1 b7-b5
2. b2-b3 ...
or
1. b2-b3 b7-b5
2. h6-c1 ...
we get
[d]8/8/8/4p3/1p2k1P1/1P3n2/5PB1/K1BR4 w - -
In chess problems, the first move is important.
how to use transposition tables to reduce the nodes viewed and prune the search tree earlier?
how to apply the transposition table in solving chess problems?