Databases
StackOverflow2013
Postsdbo
PODatabase for brute force solving board games
 

Note that there are some explanatory texts on larger screens.

plurals
  1. PODatabase for brute force solving board games
    primarykey
    data
    text
    <p>A few years back, researchers announced that they had completed a brute-force comprehensive solution to checkers. </p> <p>I have been interested in another similar game that should have fewer states, but is still quite impractical to run a complete solver on in any reasonable time frame. I would still like to make an attempt, as even a partial solution could give valuable information. </p> <p>Conceptually I would like to have a database of game states that has every known position, as well as its succeeding positions. One or more clients can grab unexplored states from the database, calculate possible moves, and insert the new states into the database. Once an endgame state is found, all states leading up to it can be updated with the minimax information to build a decision trees. If intelligent decisions are made to pick probable branches to explore, I can build information for the most important branches, and then gradually build up to completion over time.</p> <p>Ignoring the merits of this idea, or the feasability of it, what is the best way to implement such a database? I made a quick prototype in sql server that stored a string representation of each state. It worked, but my solver client ran very very slow, as it puled out one state at a time and calculated all moves. I feel like I need to do larger chunks in memory, but the search space is definitely too large to store it all in memory at once.</p> <p>Is there a database system better suited to this kind of job? I will be doing many many inserts, a lot of reads (to check if states (or equivalent states) already exist), and very few updates.</p> <p>Also, how can I parallelize it so that many clients can work on solving different branches without duplicating too much work. I'm thinking something along the lines of a program that checks out an assignment, generates a few million states, and submits it back to be integrated into the main database. I'm just not sure if something like that will work well, or if there is prior work on methods to do that kind of thing as well.</p>
    singulars
    1. PO
      singulars
      1. PTAnswer
    1. This table or related slice is empty.
    1. PTQuestion
    1. This table or related slice is empty.
    1. UScaptncraig
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. PO
      singulars
      1. PTAnswer
    2. PO
      singulars
      1. PTAnswer
    3. PO
      singulars
      1. PTAnswer
    1. VO
      singulars
      1. PODatabase for brute force solving board games
      1. This table or related slice is empty.
      1. VTUpMod
    2. VO
      singulars
      1. PODatabase for brute force solving board games
      1. USypercubeᵀᴹ
      1. VTFavorite
    3. VO
      singulars
      1. PODatabase for brute force solving board games
      1. This table or related slice is empty.
      1. VTUpMod
    1. COJust a thought: If you're storing the results centrally, then some pretty heavy calculation would have to go on prior to new datasets being accepted into the main database. So even if you were distributing the work among many clients, your central machine could still be extremely overworked.
      singulars
      1. PODatabase for brute force solving board games
      1. USChris Harrison
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload