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 🙏

© 2024 – Pkg Stats / Ryan Hefner

typedcube

v1.0.0

Published

A Rubiks's cube solver written in TypeScript with primitive methods

Downloads

3

Readme

typedcube

What is typedcube?

Typedcube is an Typescript lib that solves the Rubiks cube using primitive methods. It is not very fast but I created this for fun (and a school project)

How it works

It works by solvving the upper face first. Then it solved the first and second row of the sides(relative to the top). Then it goes on to solving the bottom face. After that it completes the cube by solving the third row(again, relative to the top side)

The structure

There are a few classes to model the cube and its faces(Cube and Face).

The main structure consists out of testers and helpers. The tester test if a condition is met, e.g. a face is solved or if there is a corner piece on a face. Then there are the helpers: These do the actual solving. For example solving the upper cross or solving the second layer. In the end it tries to optimize the algorthm to shorten it down a bit.

Documentation

Comming soon (tm)

Performance / Moves to solve

The lib calculates the solution in a very unefficient way. This doesn't really matter, as efficiency wasn't the main goal of this project. Maybe there is some room for improvements later on.