[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
[gnugo-devel] TODO revisions
From: |
Gunnar Farnebäck |
Subject: |
[gnugo-devel] TODO revisions |
Date: |
Thu, 26 Aug 2004 04:26:07 +0200 |
User-agent: |
EMH/1.14.1 SEMI/1.14.3 (Ushinoya) FLIM/1.14.2 (Yagi-Nishiguchi) APEL/10.3 Emacs/21.3 (sparc-sun-solaris2.9) MULE/5.0 (SAKAKI) |
Some proposed revisions of TODO.
/Gunnar
Index: TODO
===================================================================
RCS file: /cvsroot/gnugo/gnugo/TODO,v
retrieving revision 1.16
diff -u -r1.16 TODO
--- TODO 30 Jul 2003 15:45:26 -0000 1.16
+++ TODO 25 Aug 2004 22:26:31 -0000
@@ -71,8 +71,6 @@
half_eye_data, worm and dragon to use the same structure as the
dragon2 array.
- * Implement persistent caching in the semeai code.
-
* Support for ko in eyes.db and optics.c.
* Integrate the time handling code in play_gtp.c with the autolevel
@@ -80,10 +78,6 @@
better. Basing it on some solid system identification theory and/or
control theory wouldn't hurt.
- * Create a paradigm for handling other types of ko (approach move ko,
- multi-step ko, etc) and then write code that handles them.
- (Difficult!)
-
* Write a script which plays through the joseki databases and checks
that the engine really generates a joseki move for all positions in
the databases. This would also be interesting to run with the
@@ -178,17 +172,12 @@
* Making the engine use many machines loosely connected on the
internet or in a cluster.
- * Think on the opponents time.
+ * Think on the opponent's time.
* A global alpha-beta reader. This would probably be very slow and
could only read 2 or 3 moves ahead. Still it could find fatal
errors and improve the moves that GNU Go makes.
- * A pattern based tactical reader instead of the hard coded one.
- This could be made stronger than the current by taking into account
- more moves. The challenge is to keep it on focus so that the
- reading does not take forever.
-
* A strategic module that identifies high-level goals and then gives
these goals to the rest of the engine. It should be able to
identify if we are ahead in territory or thickness, if we should
@@ -215,3 +204,7 @@
in doing machine learning experiments with GNU Go could try
working with fuseki. This may be one of the areas with most
potential for substantial and reasonably quick improvements.
+
+ * Create a paradigm for handling other types of ko (approach move ko,
+ multi-step ko, etc) and then write code that handles them.
+
- [gnugo-devel] TODO revisions,
Gunnar Farnebäck <=