Search algorithm
Moderator: Ras
-
- Posts: 1
- Joined: Thu Jan 30, 2025 4:42 pm
- Full name: Евгений николаевич корнил
Search algorithm
Как вы думаете будет работать для шахмат алгоритм gsr, выбирается точка для каждого узла, например rand() ℅56+1. Ходы до точки хорошие, после плохие и глубина поиска - 1. Как кроссовер в генетических алгоритмах?
-
- Posts: 85
- Joined: Mon Apr 15, 2024 8:30 pm
- Full name: Arthur Matheus
Re: Search algorithm
Search Algorithm
Do you think the GSR algorithm would work for chess? A point is chosen for each node, for example, rand() % 56 + 1. Moves up to the point are good, after that, they are bad, and the search depth is 1. Like crossover in genetic algorithms?
-
- Posts: 12334
- Joined: Thu Mar 09, 2006 12:57 am
- Location: Birmingham UK
- Full name: Graham Laight
Re: Search algorithm
Translated from Russian by Google:
"How do you think the gsr algorithm will work for chess, a point is selected for each node, for example rand() ℅56+1. Moves before the point are good, after are bad and the search depth is 1. How is crossover in genetic algorithms?"
Human chess is partly about tactics and strategy, but mostly about memory
-
- Posts: 2695
- Joined: Tue Aug 30, 2016 8:19 pm
- Full name: Rasmus Althoff
Re: Search algorithm
Moderation: In general, postings are expected to be in English here. If everyone posts in a different language, we cannot have discussions.
Rasmus Althoff
https://www.ct800.net
https://www.ct800.net