Skip to content

Commit 3ef8a69

Browse files
update bestcount path doc (#122)
* update bestcount path doc * bump version * dart format . --set-exit-if-changed * fix version
1 parent db247d0 commit 3ef8a69

5 files changed

Lines changed: 8 additions & 11 deletions

File tree

CHANGELOG.md

Lines changed: 4 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1,3 +1,7 @@
1+
# 2.10.0
2+
3+
- mild update documentation of `edaxBookCountBestpath`.
4+
15
# 2.9.1
26

37
- follow Dart Package ecosystem changed. (See: https://github.com/sensuikan1973/libedax4dart/pull/118)

example/pubspec.lock

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -84,7 +84,7 @@ packages:
8484
path: ".."
8585
relative: true
8686
source: path
87-
version: "2.9.1"
87+
version: "2.10.0"
8888
meta:
8989
dependency: transitive
9090
description:

example/pubspec.yaml

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
name: libedax4dart_example
2-
version: 2.9.1-example
2+
version: 2.10.0-example
33
publish_to: none
44

55
environment:

lib/src/libedax.dart

Lines changed: 1 addition & 8 deletions
Original file line numberDiff line numberDiff line change
@@ -366,7 +366,7 @@ class LibEdax {
366366
///
367367
/// Compute the indicator of efficiency to win, which means the minimum number you should memorize on the situation both of players always choose one of the best move list.
368368
///
369-
/// This function is not only experimental but also __advanced__. <br>
369+
/// This function is very __advanced__. <br>
370370
/// __You must understand [the book structure of edax](https://choi.lavox.net/edax/book) and following important notice list__.
371371
///
372372
/// * Because internal each node lookup is stopped when book has no links, the more lower the accuracy of your book is, the more lower this feature accuracy is.
@@ -377,13 +377,6 @@ class LibEdax {
377377
/// * The depth of this feature depends on your book.
378378
/// * The moves which meet up with anoter moves is counted respectively.
379379
/// * btw, symmetric moves is counted 1 because of edax book structure.
380-
/// * O(k^N). slow.
381-
/// * TODO(developer): consider following implementation.
382-
/// * isolation.
383-
/// * save tree data on local.
384-
///
385-
/// REF: https://github.com/abulmo/edax-reversi/blob/1ae7c9fe5322ac01975f1b3196e788b0d25c1e10/src/book.c#L2438-L2447
386-
@experimental
387380
CountBestpathResult edaxBookCountBestpath(final Board board) {
388381
final dstP = calloc<bindings.Position>();
389382
final dstB = calloc<bindings.Board>();

pubspec.yaml

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
# See: https://dart.dev/tools/pub/publishing
22

33
name: libedax4dart
4-
version: 2.9.1
4+
version: 2.10.0
55
description: Dart wrapper for libedax. With using libedax4dart, you can execute functions equivalent to edax.
66
homepage: https://github.com/sensuikan1973/libedax4dart
77
documentation: https://sensuikan1973.github.io/libedax4dart

0 commit comments

Comments
 (0)