U+3164 is often confused with U+1364 due to mixing up digits. So people search for "U+1364 copy" instead of "U+3164 copy".
So, here is the correct link: U+1364 copy
U+3164 is often confused with U+1364 due to mixing up digits. So people search for "U+1364 copy" instead of "U+3164 copy".
So, here is the correct link: U+1364 copy
#!/bin/bash | |
set -euo pipefail | |
DIR="$(cd "$(dirname "${BASH_SOURCE[0]}")" >/dev/null 2>&1 && pwd)" | |
TARGET="/var/www/virtual/floppnet/activities.flopp.net/" | |
LOG="/home/floppnet/project-logs/activities.log" | |
SCRIPT="$0" |
Chinese docs: https://github.com/BPI-STEAM/BPI-BIT-Arduino-IDE/wiki | |
Code examples: https://github.com/BPI-STEAM/BPI-BIT-Arduino-IDE | |
1. Download Arduino IDE | |
2. sudo apt install python-serial | |
3. Install Espressif Arduino Stuff: | |
- mkdir hardware/espressif | |
- git clone https://github.com/espressif/arduino-esp32.git esp32 | |
- cd esp32/ | |
- git submodule update --init --recursive |
{"data":[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[ |
''' | |
Simple tic-tac-toe game built using minimax algorithm. AI recursively traverses game tree branches | |
by alternating between minimum and maximum score values until it finds the optimal move for | |
the given scenario. | |
''' | |
board = [[0, 0, 0], | |
[0, 0, 0], | |
[0, 0, 0]] |
### Keybase proof | |
I hereby claim: | |
* I am flopp on github. | |
* I am flopp (https://keybase.io/flopp) on keybase. | |
* I have a public key whose fingerprint is 897B 3AE3 EA96 98D1 EE58 C992 3287 5B48 6E79 D68F | |
To claim this, I am signing this object: |
#!/usr/bin/python | |
"""Fetches portal data from Ingress.""" | |
import argparse | |
import json | |
import logging | |
import math | |
import multiprocessing | |
from multiprocessing import pool |