Update README for publication on SDF Gitea instance.

Cargo.toml

@@ -1,6 +1,6 @@
 [package]
 name = "dag-mcts"
-version = "0.1.0"
+version = "0.2.0"
 authors = ["Stu Black <trurl@freeshell.org>"]
 edition = "2018"
 
@@ -8,7 +8,7 @@ edition = "2018"
 log = "0.4.6"
 rand = "0.7.0"
 rayon = "1"
-search-graph = { git = "https://github.com/dstu/search-graph.git", branch = "master" }
+search-graph = { git = "https://git.sdf.org/trurl/search-graph.git", branch = "main" }
 rand_pcg = "0.2.0"
 
 [dev-dependencies]

README.md

@@ -0,0 +1,28 @@
+# Overview
+
+This crate provides an implementation of Monte Carlo tree search. It uses a
+directed acylic graph (DAG) to represent the game tree. As a result, it may
+provide a more compact representation than traditional Monte Carlo tree search,
+which may duplicate game states and dilute statistics if the same game state can
+be reached by two different routes of play.
+
+To use this crate:
+
+* Implement the `Game` trait for a game of your choice.
+* Initialize search with `RolloutPhase::initialize`.
+* Execute search steps through the crate API.
+
+This code is still provisional and needs substantial testing and shaking-down.
+
+# Copyright
+
+Copyright 2015-2025, Donald S. Black.
+
+Licensed under the Apache License, Version 2.0 (the “License”); you may not use
+this file except in compliance with the License. You may obtain a copy of the
+License at http://www.apache.org/licenses/LICENSE-2.0.
+
+Unless required by applicable law or agreed to in writing, software distributed
+under the License is distributed on an “AS IS” BASIS, WITHOUT WARRANTIES OR
+CONDITIONS OF ANY KIND, either express or implied. See the License for the
+specific language governing permissions and limitations under the License.

README.org

@@ -1,31 +0,0 @@
-* Overview
-
-This package provides an implementation of the game Thud (as described at
-http://discworld.wikia.com/wiki/Thud_(game)). It contains provisional code for
-console- and GTK-based UIs and an AI based on Monte Carlo tree search. (Note
-that naive Monte Carlo tree search is known not to be a very good algorithm for
-playing games like Thud. This codebase is intended as a platform for exploring
-why that is so.)
-
-** Algorithms
-
-The =mcts= module provides a preliminary implementation of Monte Carlo tree
-search for the game of Thud. It may eventually be factored out into a more
-generic library for rollout-based move planning.
-
-* Copyright
-
-Copyright 2015-2016, Donald S. Black.
-
-Licensed under the Apache License, Version 2.0 (the “License”); you may not use
-this file except in compliance with the License. You may obtain a copy of the
-License at http://www.apache.org/licenses/LICENSE-2.0.
-
-Unless required by applicable law or agreed to in writing, software distributed
-under the License is distributed on an “AS IS” BASIS, WITHOUT WARRANTIES OR
-CONDITIONS OF ANY KIND, either express or implied. See the License for the
-specific language governing permissions and limitations under the License.
-
-* Legal disclaimer
-
-"Thud", "Discworld", and related terms are not my intellectual property.