nns2009

Watch the video about how I made the Worst game of the Brackeys jam (out of 1086):

https://youtu.be/Tpeu1-gqA3o

These are Google Chrome console scripts I used to make this video in the order I used them

nns2009

// ----------------------------------------------------------
// ----------------------------------------------------------
// --------------------- Farm with Code ---------------------
// ----------------------------------------------------------
// ----------------------------------------------------------

// In this game you need to code your drone(s) in JavaScript to farm for you.
// Here is a sample code to do some farming.
// Read game page for more instructions.

nns2009

# Made in 21 second
# Watch this video to see how:
# https://youtu.be/r3a9obNqno4

from random import randint
m = 5
while True:
	a = randint(m, 3*m)
	b = randint(m, 3*m)
	print(f'{a} * {b} = ?')

nns2009

# Made in 43 seconds
# Watch this video to see how:
# https://youtu.be/vnYES_fba-M

from random import randint


n = randint(20, 30)
while True:
	print(f'{n:2}', '|' * n)

nns2009

// This script is the common part of the set up to use parametric objects in Unity:
// Watch the video-tutorial with explanation here:
// https://youtu.be/KCDYdQUufhs

using System.Collections;
using System.Collections.Generic;
using UnityEditor;
using UnityEngine;

[CustomEditor(typeof(Room))]

nns2009

// Count sort I coded while counting every single key I press
// Watch video here:
// https://youtu.be/HFgzhYHM4QM
function countSort(vs) {
    const cs = Array(Math.max(...vs) + 1).fill(0);
    let res = [];
    for (let v of vs)
        cs[v]++;
    for (let v = 0; v < cs.length; v++) {
        for (let c = 0; c < cs[v]; c++)

nns2009

// Made from scratch in just 8 minutes 23 seconds
// Watch this video to see how:
// https://youtu.be/aP9eKrnyxe4
// Play online here:
// https://nns2009.itch.io/just-maze

using Cinemachine;
using System.Collections;
using System.Collections.Generic;
using System.Linq;

nns2009

// Watch this video to see how I crafted this sorting algorithm:
// https://youtu.be/Mh_1V95n0j0

function bDQnoAh__3IqiQ6w(MbK$rQXzgSJSupW) {
    return Math.floor(Math.random() * MbK$rQXzgSJSupW);
}

function E68sk_VA6aM3y9ts1DO4S(xAAyxUzJedDW4t_) {
    for (let SUiFIpIVdvQFCy = 1; SUiFIpIVdvQFCy < xAAyxUzJedDW4t_.length; SUiFIpIVdvQFCy++) {
        if (xAAyxUzJedDW4t_[SUiFIpIVdvQFCy-1] > xAAyxUzJedDW4t_[SUiFIpIVdvQFCy])

nns2009

# Made in 37 seconds
# Watch this video to see how:
# https://youtu.be/uvKG7uki_N8
# Play the extended HTML port on Itch:
# https://nns2009.itch.io/guess-with-lies

from random import randrange
n = randrange(10000)
while True:
    v = int(input())

nns2009

// Watch https://youtu.be/KvYzGsz5vHA to see how I coded this with some commentary

let add = (n, v) => !n ? { v } : { ...n, [v < n.v]: add(n[v < n.v], v) }
let flat = n => !n ? [] : [...flat(n[!0]), n.v, ...flat(n[!1])]
let bsort = vs => flat(vs.reduce(add, null))
// 182 characters with nice formatting

let add=(n,v)=>!n?{v}:{...n,[v<n.v]:add(n[v<n.v],v)}
let flat=n=>!n?[]:[...flat(n[!0]),n.v,...flat(n[!1])]
let bsort=vs=>flat(vs.reduce(add,null))