A simple strategy for zoomy-focus dom elements

I really don't like the way youtube did their new Fullscreen UI so i decided to fix it with tamper monkey script. No more Suggested Video Grids on the bottom of your screen eating all of your pixel real estate!

MonkeyGridWalk

No description available

There is a monkey which can walk around on a planar grid. The monkey can move one space at a time left, right, up or down. That is, from (x, y) the monkey can go to (x+1, y), (x-1, y), (x, y+1), and (x, y-1). Points where the sum of the digits of the x coordinate plus the sum of the digits of the y coordinate are greater than 25 are inaccessible to the monkey. For example, the point (59, 79) is inaccessible because 5 + 9 + 7 + 9 = 30, which is greater than 25. The sum of the digits for negative coordinates should be calculated based on the absolute value. For example, the sum of the digits of (-22, 12) equals the sum of the digits of (22, 12). How many points can the monkey access if it starts at (0, 0), including (0, 0) itself?

There is a monkey which can walk around on a planar grid. The monkey can move one space at a time left, right, up or down. That is, from (x, y) the monkey can go to (x+1, y), (x-1, y), (x, y+1), and (x, y-1). Points where the sum of the digits of the absolute value of the x coordinate plus the sum of the digits of the absolute value of the y coordinate are lesser than or equal to 19 are accessible to the monkey. For example, the point (59, 79) is inaccessible because 5 + 9 + 7 + 9 = 30, which is greater than 19. Another example: the point (-5, -7) is accessible because abs(-5) + abs(-7) = 5 + 7 = 12, which is less than 19. How many points can the monkey access if it starts at (0, 0), including (0, 0) itself?

Grid Monkey: A bingo-themed roguelike inspired by Balatro and also by my experiences working in the slot machine industry

Code Monkeys Grid Tutorial

Adds A Monkey Grid

No description available

No description available

No description available

No description available

No description available

No description available

A basic "endless grid" demonstration using Monkey's Mojo 2 module.

No description available

No description available

Initial commit

Code monkeys grid implementation with isometric coordinates

Open-source off-grid power, water purification, and homestead systems built from hardware store materials

No description available

Css-Grid take on the infinite monkey theorm

My submission for a pathfinding algorithm in a small grid-based game where a monkey needs to catch bananas on a grid.

A C program involving a 2D grid based simulation where a monkey seeks out treats on a grid using a Breadth-First Search algorithm

Hungry Monkey is a C programming project that simulates a monkey moving through a grid-based field, collecting treats. The monkey uses a pathfinding algorithm to maximize the number of treats it collects as the field updates over time. The project includes a console visualization (hungry_monkey_printf.c)

A C program where an AI monkey catches falling treats. Implemented a greedy algorithm to move the monkey toward the closest reachable treat each turn. Features dynamic grid updates and state persistence between moves.

Monkey Test is a "Scrap Book" for autotesting, via browser standard (firefox,chrome,ie11), browserstack (or other selenium grid), and appium (for the app).

:elephant: :sheep: :cow: :koala: :monkey_face: :cat2: Safari Rush Hour, a 7 x 7 grid game (Escape Rover "x" that moves in all directions)

The Memory Game is a colorful, visually-appealling, and fully interactive program that generates a 5x5 grid of unknown pictures. To play, simply click on any box and a picture of a monkey will flip over! Match this monkey to an identical monkey and that will create a successful pair. By matching every unique pair, you win the game!