English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Let $f(n)$ be the maximum number of steps of Topswops on $n$ cards. In thisnote, we report our computational experiments to determine the values of$f(18)$ and $f(19)$. By applying an algorithm developed by Knuth in a parallelfashion, we conclude that $f(18)=191$ and $f(19)=221$.

Maximum Number of Steps of Topswops on 18 and 19 Cards