npm package discovery and stats viewer.

Discover Tips

  • General search

    [free text search, go nuts!]

  • Package details

    pkg:[package-name]

  • User packages

    @[username]

Sponsor

Optimize Toolset

I’ve always been into building performant and accessible sites, but lately I’ve been taking it extremely seriously. So much so that I’ve been building a tool to help me optimize and monitor the sites that I build to make sure that I’m making an attempt to offer the best experience to those who visit them. If you’re into performant, accessible and SEO friendly sites, you might like it too! You can check it out at Optimize Toolset.

About

Hi, 👋, I’m Ryan Hefner  and I built this site for me, and you! The goal of this site was to provide an easy way for me to check the stats on my npm packages, both for prioritizing issues and updates, and to give me a little kick in the pants to keep up on stuff.

As I was building it, I realized that I was actually using the tool to build the tool, and figured I might as well put this out there and hopefully others will find it to be a fast and useful way to search and browse npm packages as I have.

If you’re interested in other things I’m working on, follow me on Twitter or check out the open source projects I’ve been publishing on GitHub.

I am also working on a Twitter bot for this site to tweet the most popular, newest, random packages from npm. Please follow that account now and it will start sending out packages soon–ish.

Open Software & Tools

This site wouldn’t be possible without the immense generosity and tireless efforts from the people who make contributions to the world and share their work via open source initiatives. Thank you 🙏

© 2026 – Pkg Stats / Ryan Hefner

@echecs/buchholz

v3.0.0

Published

Buchholz tiebreak system for chess tournaments following FIDE rules. Includes Buchholz, Cut-1, Cut-2, Median-1, Median-2, Average of Opponents' Buchholz, and Fore Buchholz. Zero dependencies.

Downloads

525

Readme

Buchholz

npm Test Coverage License: MIT

Buchholz is a TypeScript library implementing the Buchholz tiebreak family for chess tournaments, following the FIDE Tiebreak Regulations (section 8). Zero runtime dependencies.

Installation

npm install @echecs/buchholz

Quick Start

import { buchholz } from '@echecs/buchholz';
import type { Game, GameKind } from '@echecs/buchholz';

// games[n] = round n+1; Game has no `round` field
const games: Game[][] = [
  [{ black: 'B', result: 1, white: 'A' }], // round 1
  [{ black: 'C', result: 0, white: 'A' }], // round 2
  [{ black: 'A', result: 0.5, white: 'D' }], // round 3
  // Unplayed rounds use kind to classify the bye type (FIDE article 16)
  [{ black: '', kind: 'half-bye', result: 0.5, white: 'A' }], // round 4
];

const score = buchholz('A', games);
// Returns sum of all opponents' tournament scores (byes excluded)

API

All functions accept (playerId: string, games: Game[][], players?: Player[]) and return number. Round is determined by array position: games[0] = round 1, games[1] = round 2, etc. The Game type has no round field.

The optional kind?: GameKind field on Game classifies unplayed rounds for FIDE article 16 compliance. Valid values: 'forfeit-loss', 'forfeit-win', 'full-bye', 'half-bye', 'pairing-bye', 'zero-bye'. When absent the game is treated as a normal over-the-board result.

buchholz(playerId, games, players?)

FIDE section 8.1 — Full Buchholz score. Returns the sum of the tournament scores of all opponents faced by playerId. Byes are excluded.

buchholzCut1(playerId, games, players?)

FIDE section 8.1 + modifier 14.1 — Buchholz minus the lowest-scoring opponent. Sorts opponents' scores ascending and removes the first before summing. When the player has voluntary unplayed rounds (VURs), the FIDE article 16.5 Cut-1 Exception ensures the lowest VUR contribution is cut first.

buchholzCut2(playerId, games, players?)

FIDE section 8.3 — Buchholz minus the two lowest-scoring opponents. Removes the two lowest scores before summing.

buchholzMedian1(playerId, games, players?)

FIDE section 8.4 — Median Buchholz. Removes one highest and one lowest opponent score before summing.

buchholzMedian2(playerId, games, players?)

FIDE section 8.5 — Double Median Buchholz. Removes the two highest and two lowest opponent scores before summing.

averageOpponentsBuchholz(playerId, games, players?)

FIDE section 8.6 — Average Buchholz of opponents. Returns the mean of the full Buchholz scores of each opponent faced. Returns 0 when no opponents have been faced.

foreBuchholz(playerId, games, players?)

FIDE section 8.7 — Fore-Buchholz (Buchholz-Buchholz). Returns the sum of each opponent's own full Buchholz score — one level of recursion beyond the standard Buchholz.

Contributing

Contributions are welcome. Please open an issue at github.com/mormubis/buchholz/issues.