diff options
| author | Mario Lang <mlang@delysid.org> | 2014-04-18 17:09:40 +0200 |
|---|---|---|
| committer | Mario Lang <mlang@delysid.org> | 2014-04-18 17:09:40 +0200 |
| commit | 6eaf29547016256a61dd5d9cc4d39708d728788b (patch) | |
| tree | e56bf6a42ee16a6d84c61790b67b9ee556e35028 | |
| parent | 21c5106bf8c043db243a18e7c365d8dc3200ddfa (diff) | |
Silly typo.
| -rw-r--r-- | chess-perft.el | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/chess-perft.el b/chess-perft.el index dd6cc55..b01a1c3 100644 --- a/chess-perft.el +++ b/chess-perft.el @@ -20,7 +20,7 @@ ;;; Commentary: -;; The classic perft function counts all leave nodes at a certain depth. +;; The classic perft function counts all leaf nodes at a certain depth. ;; To make it easier to identify specific problems we also count properties ;; of the individual (final) plies. We count capturing plies, en passant plies, ;; castling plies, plies that promote to a piece, @@ -48,9 +48,9 @@ (require 'ert) (defun chess-perft (position depth) - "Count all leave nodes of the tree starting at POSITION pruned at DEPTH. + "Count all leaf nodes of the tree starting at POSITION pruned at DEPTH. The result is a list of the form - (LEAVES CAPTURES EN-PASSANTS CASTLES PROMOTIONS CHECKS CHECKMATES)." + (LEAFS CAPTURES EN-PASSANTS CASTLES PROMOTIONS CHECKS CHECKMATES)." (if (zerop depth) (cl-values 1 0 0 0 0) (let ((plies (chess-legal-plies position |