Generate, Visualise, and Evaluate Fast-and-Frugal Decision Trees R package FFTrees version 2.1.0 Create, visualize, and test fast-and-frugal decision trees (FFTs) using the algorithms and methods described by Phillips, Neth, Woike & Gaissmaier (2017), <doi:10.1017/S1930297500006239>. FFTs are simple and transparent decision trees for solving binary classification problems. FFTs can be preferable to more complex algorithms because they require very little information, are easy to understand and communicate, and are robust against overfitting. Software Depends: R(>= 3.5.0) Imports: caret, cli, dplyr, knitr, magrittr, scales, stringr, testthat, tibble Suggests: rmarkdown, spelling, tidyselect Hansjoerg Neth <h.neth@uni.kn> Comprehensive R Archive Network (CRAN) Nathaniel Phillips [aut] (ORCID: <https://orcid.org/0000-0002-8969-7013>), Hansjoerg Neth [aut, cre] (ORCID: <https://orcid.org/0000-0001-5427-3141>), Jan Woike [aut] (ORCID: <https://orcid.org/0000-0002-6816-121X>), Wolfgang Gaissmaier [aut] (ORCID: <https://orcid.org/0000-0001-6273-178X>) CC0 2025-09-02 application/tgz https://CRAN.R-project.org/package=FFTrees doi:10.32614/CRAN.package.FFTrees en-US