November 2022
September 2022
the AI would have to plan like 3-11 steps ahead half way through a game so that's O=32^11 maximum iterative steps with a lot of shorter routes that take less time to determine tracing down to a next step decision to make an optimal move,
AI can learn commonality trough circular slices of the grid covering the grid in action with overlapping circulation and from this it could find optimal leaning when ii's thinking upto 11 steps ahead.
At the beginning it has to think closer to 5-9 steps ahead and as the game comes to a close less computation is required.
There is some optimal range of steps you need to access in advanced and a maximum number of variations you need to be aware of and optimal ways of organising the whole approach below 32^11 steps for any given move to hit close to the optimal algorithm for playing the perfect game of chess.
Go would require far more wisdom of paths ahead unless someone else can crack it's code.
Our partner
Thoughts from transgressing dimension
Here you can see some of my wild thoughts and you may find some good worldly ideas on here. I just love thinking and thought I should let my thinking be read.
Here you can see some of my wild thoughts and you may find some good worldly ideas on here. I just love thinking and thought I should let my thinking be read.
Who is online
Registered users: Bing [Bot], glovby, Google [Bot], Google Adsense [Bot], Google Feedfetcher
- Home ‹ Board index ‹ Blogs ‹ highdimensionman's Blog ‹ Perfect Chess.
- Contact • Advertise on Psychforums • The team • Delete all board cookies • All times are UTC
News
Site map
SitemapIndex
RSS FeedCheck Mental Health Matters
Powered by phpBB © 2000, 2002, 2005, 2007, 2014 phpBB Group
Time : 1.581s | 22 Queries | GZIP : Off | Load : 3.32
Time : 1.581s | 22 Queries | GZIP : Off | Load : 3.32