kelsny

import OpeningBook from "../book/dynamic.js";
import { Adversary, Bitboard, Board, GameState, Move, MoveGenerator, Piece, Zobrist } from "../index.js";
import { AdversaryBestMoveConfig } from "./Adversary.js";

const PawnValue = 100;
const KnightValue = 300;
const BishopValue = 320;
const RookValue = 500;
const QueenValue = 900;

kelsny

import { Adversary, Bitboard, Board, GameState, Move, MoveGenerator, Piece } from "../index.js";

const PawnValue = 100;
const KnightValue = 300;
const BishopValue = 320;
const RookValue = 500;
const QueenValue = 900;

const squareControlledByOpponentPawnPenalty = 350;
const capturedPieceValueMultiplier = 10;

kelsny

// 7 points lay equally distanced on a circle. 3 points are chosen at random. What’s the probability that the triangle formed by the 3 points is acute?

const points: [x: number, y: number][] = [];

for (let i = 0; i < 7; i++) {
  const angle = Math.PI * 2 * (i / 7);

  points.push([Math.cos(angle), Math.sin(angle)]);
}

kelsny

(()=>{var e={"./node_modules/call-bind/callBound.js":(e,t,r)=>{var n=r("./node_modules/get-intrinsic/index.js"),o=r("./node_modules/call-bind/index.js"),i=o(n("String.prototype.indexOf"));e.exports=function(e,t){var r=n(e,!!t);return"function"==typeof r&&i(e,".prototype.")>-1?o(r):r}},"./node_modules/call-bind/index.js":(e,t,r)=>{var n=r("./node_modules/function-bind/index.js"),o=r("./node_modules/get-intrinsic/index.js"),i=o("%Function.prototype.apply%"),s=o("%Function.prototype.call%"),u=o("%Reflect.apply%",!0)||n.call(s,i),a=o("%Object.getOwnPropertyDescriptor%",!0),l=o("%Object.defineProperty%",!0),c=o("%Math.max%");if(l)try{l({},"a",{value:1})}catch(e){l=null}e.exports=function(e){var t=u(n,s,arguments);if(a&&l){var r=a(t,"length");r.configurable&&l(t,"length",{value:1+c(0,e.length-(arguments.length-1))})}return t};var p=function(){return u(n,i,arguments)};l?l(e.exports,"apply",{value:p}):e.exports.apply=p},"./node_modules/deep-equal/index.js":(e,t,r)=>{var n=r("./node_modules/object-keys/index.js"),o=r(

kelsny

noop
noop
addx 5
addx 3
addx -2
noop
addx 5
addx 4
noop
addx 3

kelsny

These are my solutions to the RoboScript series of katas on CodeWars.

This Kata Series is based on a fictional story about a computer scientist and engineer who owns a firm that sells a toy robot called MyRobot which can interpret its own (esoteric) programming language called RoboScript. Naturally, this Kata Series deals with the software side of things (I'm afraid Codewars cannot test your ability to build a physical robot!).

• RoboScript #1 - Syntax Highlighting
  • remarks: pretty simple and straight-forward
  • tip: don't chain .replace calls as it can lead to unexpected results
  • hint: replacer function
• RoboScript #2 - RS1 specification
• remarks: needed to sit and think for a lil' while

kelsny

type UnaryFunction<T, R> = (source: T) => R;

type Identity = <T>(source: T) => T;

type Pipe<T, L = void, R extends UnaryFunction<any, any>[] = []> =
    T extends []
        ? R
        : L extends void
            ? T extends [(_: infer P) => infer V, ...infer Rest]
                ? Pipe<Rest, V, [...R, UnaryFunction<P, V>]>

kelsny

type UnaryFunction<T, R> = (source: T) => R;

type Pipe<T, L = void, R extends UnaryFunction<any, any>[] = []> =
    T extends []
        ? R
        : L extends void
            ? T extends [(_: infer P) => infer V, ...infer Rest]
                ? Pipe<Rest, V, [...R, UnaryFunction<P, V>]>
                : never[]
            : T extends [(_: L) => infer V, ...infer Rest]