When making this website, i wanted a simple, reasonable way to make it look good on most displays. Not counting any minimization techniques, the following 58 bytes worked well for me:
main {
max-width: 38rem;
padding: 2rem;
margin: auto;
}| from astropy.coordinates import EarthLocation,SkyCoord | |
| from astropy.time import Time | |
| from astropy import units as u | |
| from astropy.coordinates import AltAz | |
| observing_location = EarthLocation(lat='52.2532', lon='351.63910339111703', height=100*u.m) | |
| observing_time = Time('2017-02-05 20:12:18') | |
| aa = AltAz(location=observing_location, obstime=observing_time) | |
| coord = SkyCoord('4h42m', '-38d6m50.8s') |
| import sys | |
| def j(lineno): | |
| frame = sys._getframe().f_back | |
| called_from = frame | |
| def hook(frame, event, arg): | |
| if event == 'line' and frame == called_from: | |
| try: | |
| frame.f_lineno = lineno |
| ### JHW 2018 | |
| import numpy as np | |
| import umap | |
| # This code from the excellent module at: | |
| # https://stackoverflow.com/questions/4643647/fast-prime-factorization-module | |
| import random |
| """ | |
| A minimal implementation of Monte Carlo tree search (MCTS) in Python 3 | |
| Luke Harold Miles, July 2019, Public Domain Dedication | |
| See also https://en.wikipedia.org/wiki/Monte_Carlo_tree_search | |
| https://gist.github.com/qpwo/c538c6f73727e254fdc7fab81024f6e1 | |
| """ | |
| from abc import ABC, abstractmethod | |
| from collections import defaultdict | |
| import math |
| """ | |
| Try to sclambre wrods itno the msot porbable wrooddis *not* in the | |
| lexcion. We optimize the priblitaboy unsig hlil-cimbling wtih random | |
| restrat. The ruselt: pettry asuming. The pragrom: pettry solw. | |
| """ | |
| import collections | |
| import operator | |
| import random | |
| import re |