I updated PAM to 0.9.18 (
https://github.com/wdjoyner/pam) and then made this OC hotel check-in scene with the recently added faces and expressions:
https://youtu.be/M9edCbTcA5YGitHub - wdjoyner/pam: Pose And Motion library for humanoid graphs (vertices for the joints, edges for the bones) in manim
Pose And Motion library for humanoid graphs (vertices for the joints, edges for the bones) in manim - wdjoyner/pam
The rough cut of Too Nice To Die act 3 is finished:
https://youtu.be/kK9nMx5WDTg
Too Nice To Die, act 3 (rough cut)
a revised version of "Lucy meets Lenny" now with the dog Ramis:
https://youtu.be/DdluihTgraYthis was created from a python library of motions and figures for the animation/graphics system manim. For more details, see the github repo: github.com/wdjoyner/pam
#python #manim #animation #pam-python
Lucy meets Lenny, revisited
Here's a new video I made:
https://youtu.be/xZHVSWl8WcoSee
https://github.com/wdjoyner/pam for more details.
Hope you enjoy:-)
Mayor Nona Sonnof vs the AI Governor of Venus
I've been working on a chess analysis program using stockfish and python. Here's an announcement:
https://www.chess.com/blog/davidjoyner/introducing-cga-a-chess-game-analyzer
Introducing CGA: A Chess Game Analyzer
Which games from a large database are actually worth studying? CGA (Chess Game Analyzer) answers that question systematically. CGA is a Python-based pipeline that processes PGN collections, runs Stockfish analysis, and scores games using a multi-factor algorithm designed to weigh tactical sacrifices,
Black and White - Futility Closet
With this problem D.W.A. Brotherton won second prize in a 1955 competition for British composers under 21. White to mate in two moves.
The Elevator Problem (3/3)
Move: If you press the button and some other elevator than elevator e arrives, you can tell it to go to any floor you wish.
Taboo: you can press the elevator button if and only if no elevator is moving down.
Is there a finite sequence of moves that allows you to ride in elevator e?
The Elevator Problem (2/3)
the way the elevator logic works is this: when you press the elevator button, the one closest to you (= the one on floor number min(fk, k>0)) is told to go to 0. If there is a tie then, of those on the same lowest floor, the elevator with the smallest number is told to go to 0.
Goal: Suppose you want to use elevator e (e=1, 2, ..., n).
The Elevator Problem (1/2)
you are on the bottom floor (floor 0, lets call it) and there are three elevators, which we number 1,2,...,n. we may assume the elevators are on floors f1, f2, ... , where fk>0 is the floor elevator k is currently on, 1<=k<=n.
