Event JSON
{
"id": "6a519cbef90f7df3692af6bb33adfa406122eaba63aaaaa8d3a27770035287f0",
"pubkey": "4c3f7dc2828d50845b87547e5379efcf642513359cf36e3ceb9d2873e0daca99",
"created_at": 1688846488,
"kind": 1,
"tags": [
[
"p",
"9ddd61cd22c0d35a2ad2df39f48120e3bdbba4d28920abbedea59a089a01de8d",
"wss://relay.mostr.pub"
],
[
"p",
"46cbf6cc245336daf1486332e6918189b74c6c7d693153661af9a7365f3bb74c",
"wss://relay.mostr.pub"
],
[
"p",
"d7191c027e4e55eaad6516dc5671f33f1ea4ea5be4fd400b3343657e7dd83c06",
"wss://relay.mostr.pub"
],
[
"e",
"cf57818236909fd3fa1d6196464342e2773eac546d52b82f158d6fd494ccc4d2",
"wss://relay.mostr.pub",
"reply"
],
[
"mostr",
"https://fosstodon.org/users/dev_ric/statuses/110680243479569952"
]
],
"content": "nostr:npub1nhwkrnfzcrf452kjmuulfqfquw7mhfxj3ys2h0k75kdq3xspm6xs6gg2sy nostr:npub1gm9ldnpy2vmd4u2gvvewdyvp3xm5cmradyc4xes6lxnnvhemkaxqmaen9k you probably want to start by looking up A* pathfinding. Essentially it's just a way of calculating the shortest route between two places by scoring each adjacent tile from every other, based on how many hops it took to get there. Same maths however many adjacents you have so it should work for hex quite nicely. I'm 99.9% certain a YouTube search will explain better than I can...",
"sig": "ae83182128bb4491e2697fbe0f226494952ee4fa1018712f65af1b5f52bcd84d62f6beae2cd368bdcd0adcedb85499e7cd9c500d0359082dc5b4a61266ce1bd5"
}
