#2 Playing algorithms using graph analysis

open
nobody
None
5
2008-04-09
2007-12-07
No

Current algorithms don't analyse graph after the move. Of course analysis of all opponent's answers is kind of such analysis. This is mass and blind approach though. Or better said "brutal force" analysis.
More beautifull way is to focus on most important. Analyse the graph after the move. It has to be defined whas is to be analysed. If obtained in this way information remains (like no access to own [or opponent's] goal) or not (like no idea what).

Discussion

  • Bartosz Wójcik

    Bartosz Wójcik - 2008-04-09
    • status: open --> closed
     
  • Bartosz Wójcik

    Bartosz Wójcik - 2008-04-09

    Logged In: YES
    user_id=1947020
    Originator: YES

    I've prepared graph analysis process. This is ineffective for functional languages though. Analysis result is kind of graph state, which has to be updated after each move. This requires lot of over head and could be done in descriptive language easier.
    Solution I've prepared and implemented never worked fast enough to call it success.

     
  • Bartosz Wójcik

    Bartosz Wójcik - 2008-04-09

    Logged In: YES
    user_id=1947020
    Originator: YES

    I've prepared graph analysis process. This is ineffective for functional languages though. Analysis result is kind of graph state, which has to be updated after each move. This requires lot of over head and could be done in descriptive language easier.
    Solution I've prepared and implemented never worked fast enough to call it success.

     
  • Bartosz Wójcik

    Bartosz Wójcik - 2008-04-09
    • status: closed --> open
     

Log in to post a comment.

Get latest updates about Open Source Projects, Conferences and News.

Sign up for the SourceForge newsletter:





No, thanks