projects/chess
1
0
Fork 0
Code Issues 9 Pull Requests Actions Packages Projects Releases Wiki Activity

Add NEGAMAX Evaluation Algorithm For Chess Positions #20

New Issue
Closed
opened 2025-08-19 22:46:12 +00:00 by Josh · 0 comments
Josh commented 2025-08-19 22:46:12 +00:00
Owner
Copy Link

There are many ways to evaluate chess positions. One simple method would be to apply a MIN-MAX evaluation on each chess position. This should be simpler to implement than other methods. It will also allow us to start with a simpler AI baseline.

There are many ways to evaluate chess positions. One simple method would be to apply a MIN-MAX evaluation on each chess position. This should be simpler to implement than other methods. It will also allow us to start with a simpler AI baseline.
Josh self-assigned this 2025-08-19 22:52:26 +00:00
Josh changed title from Add MIN-MAX Evaluation Algorithm For Chess Positions to Add NEGAMAX Evaluation Algorithm For Chess Positions 2025-08-20 15:01:05 +00:00
Josh added the
WIP
 label 2025-08-20 15:29:52 +00:00
Josh closed this issue 2025-08-29 22:59:58 +00:00
Sign in to join this conversation.
No Branch/Tag Specified
Branches Tags
Labels
Clear labels
bug
Something is not working
duplicate
This issue or pull request already exists
enhancement
New feature
help wanted
Need some help
invalid
Something is wrong
question
More information is needed
WIP
wontfix
This won't be fixed
No Label
WIP
Milestone
No items
No Milestone
Projects
Clear projects
No project
Assignees
Clear assignees
Josh
No Assignees Josh
1 Participants
Notifications
Due Date
No due date set.
Dependencies

No dependencies set.

Reference: projects/chess#20
No description provided.
Delete Branch "%!s()"

Deleting a branch is permanent. Although the deleted branch may continue to exist for a short time before it actually gets removed, it CANNOT be undone in most cases. Continue?