search-graph

Data structure for optimization on a discrete space

Go to file

Stu Black 650b240dc5 Big documentation bump. More to come.		2019-07-23 17:55:35 -04:00
src	Big documentation bump. More to come.	2019-07-23 17:55:35 -04:00
.gitignore	Factored out into its own thing, with code more neatly organized.	2016-01-22 20:56:07 -05:00
Cargo.toml	Version bump for new APIs.	2019-07-23 01:12:29 -04:00
LICENSE	Factored out into its own thing, with code more neatly organized.	2016-01-22 20:56:07 -05:00
README.org	Fix glaring grammatical mistake in first sentence of README.	2016-03-21 00:31:28 -04:00
rustfmt.toml	Actually add rustfmt.toml.	2019-07-13 23:07:38 -04:00

Overview

This package provides a rollout-based graphical data structure. Its intended use is building game state graphs for general game-playing or similar AI tasks.

Vertices correspond to game states. They are addressed by unique game states (which may be de-duplicated as if by transposition table by implementing std::hash::Hash and std::cmp::Eq appropriately for your game state type).

Edges correspond to game-modifying moves. They are bidirectional, so paths may be traced up and down the graph.

The structure is rollout-based in that edges are expanded lazily. This should make it easy to implement planning algorithms like A* and Monte Carlo tree search on top of the graph structure.

At present, the graph topology may be grown but not pruned. Vertex and edge deletion may be supported in a future version.

Copyright

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.