A Normal Pig Taking a Stroll Through the Meadow

As far as I understand it, the node is more useful for car routing, since it marks the exact point on the road where the intersection crosses, while the way is more useful for pedestrian routing, where the actual path to be traveled is more relevant. I agree that it seems redundant, but for all I know, car routers might totally ignore any pedestrian footways, which would prevent them from filling in the crossing data on the fly.

porotoman99@lemmy.world · 2 months ago

You can also Ctrl+click most things in the code editor to open its documentation.

porotoman99@lemmy.world · 3 months ago

I don’t know if this is the easiest way, but it has worked well for me. I have a folder on my computer set up to be accessible from the local network. When I need to put some files on the deck, I switch it into desktop mode where I have a shortcut to the network folder. Then I just take the files out and put them wherever I need them on the deck.

porotoman99@lemmy.world · 3 months ago

Whenever I am building larger structures, I find it helpful to design smaller modular pieces that can fit together to make a larger structure. Maybe you can start with the corners to find a good way to outline the building, and then come up with some variations of tiling wall segments that you can repeat 3 or 4 times across the width of the building. Here are some examples of larger builds from my vanilla world that are just a few modular pieces put together into a larger structure:

Storage building

A rail bridge

End portal pyramid

A city

porotoman99@lemmy.world · 4 months ago

Ideon hits most of the points you mentioned. Make sure to watch the movie too for the proper ending.

porotoman99@lemmy.world · 4 months ago

For those who are curious, the text on the shirt says Kulvahdin Hooters, which basically translates to Femboy Hooters.

porotoman99@lemmy.world · 4 months ago

It’s from Mega Man StarForce 2 or 3 for the DS.

porotoman99@lemmy.world · 6 months ago

When I was 100%-ing Watch Dogs, I would see and hear the icon for hacking gates and doors whenever I went past them.

When I originally played Fallout 4, I would feel a compulsion to take any duct tape I saw.

porotoman99@lemmy.world · edit-2 9 months ago

https://myanimelist.net/profile/porotoman99

Sci-Fi

Suspense

Action

porotoman99@lemmy.world · 9 months ago

deleted by creator

porotoman99@lemmy.world · 10 months ago

I really liked the hacking puzzles in Half-Life Alyx. There was a nice variety to the different type of puzzles that could appear, and the difficulty never felt like it got out of hand.

porotoman99@lemmy.world · 10 months ago

I’m continuing Daggerfall Unity now that version 1.0 is out. There were only 2 minor issues that I had with it when I previously played, and they both look to be fixed. I’ve joined a knights order, a temple, and the Dark Brotherhood, and got my character up to a high enough level that I would be comfortable with going for the main quest.

porotoman99@lemmy.world · edit-2 11 months ago

I just finished Scorn, it was very interesting.

I feel like the combat wasn’t necessary since the puzzles and exploration felt like the main focus of the game, but at the same time, I don’t know how they could have made the environment feel dangerous without the threat of death. There was a puzzle later in the game that did require you to injure yourself, but I don’t think that would have worked as a replacement for combat in the rest of the game, and being present throughout the game would lessen the impact of it in the short moment where it is actually necessary. Also, the guns were very neat looking, so that is an additional upside to having combat.

Even though this sounds like a lot of complaining, I don’t think I could come up with any other criticisms, as pretty much everything else about the game felt perfect. I don’t think it is the sort of thing I will play again, but it will be something I will think back on more than most other games.

porotoman99@lemmy.world · 11 months ago

It looks like he has been involved in local politics, but not much is written about the last few years. https://en.wikipedia.org/wiki/Rudy_Pantoja

porotoman99@lemmy.world · 11 months ago

Does that really matter if there are proper systems to deal with the pollution?

porotoman99@lemmy.world · 11 months ago

I’ve been playing the original Doom for the first time over the last few days, and just beat it today. It was really good and I can see why it was such a big deal at the time. It was a significant improvement over Wolfenstein 3D in every way, not just technically, but also in terms of level design and story.

porotoman99@lemmy.world · edit-2 1 year ago

Python

Part 1: https://github.com/porotoman99/Advent-of-Code-2023/blob/main/Day 7/part1.py

Code

import os

filePath = os.path.dirname(os.path.realpath(__file__))
inputFilePath = filePath + "\\adventofcode.com_2023_day_7_input.txt"
# inputFilePath = filePath + "\\part1.txt"

def typeSort(hand):
	cardCount = {
		"2": 0,
		"3": 0,
		"4": 0,
		"5": 0,
		"6": 0,
		"7": 0,
		"8": 0,
		"9": 0,
		"T": 0,
		"J": 0,
		"Q": 0,
		"K": 0,
		"A": 0
	}
	for card in hand:
		cardCount[card] += 1
	cardTotals = list(cardCount.values())
	cardTotals.sort(reverse=True)
	if(cardTotals[0] == 5):
		return 6
	elif(cardTotals[0] == 4):
		return 5
	elif(cardTotals[0] == 3 and cardTotals[1] == 2):
		return 4
	elif(cardTotals[0] == 3):
		return 3
	elif(cardTotals[0] == 2 and cardTotals[1] == 2):
		return 2
	elif(cardTotals[0] == 2):
		return 1
	else:
		return 0

def bucketSort(camelCard):
	totalScore = 0
	cardOrder = ["2","3","4","5","6","7","8","9","T","J","Q","K","A"]
	hand = camelCard[0]
	totalScore += cardOrder.index(hand[4]) * 15 ** 1
	totalScore += cardOrder.index(hand[3]) * 15 ** 2
	totalScore += cardOrder.index(hand[2]) * 15 ** 3
	totalScore += cardOrder.index(hand[1]) * 15 ** 4
	totalScore += cardOrder.index(hand[0]) * 15 ** 5
	return totalScore

hands = []
bids = []

with open(inputFilePath) as inputFile:
	for line in inputFile:
		lineSplit = line.split()
		hand = lineSplit[0]
		bid = lineSplit[1]
		hands.append(hand)
		bids.append(bid)

bids = [int(bid) for bid in bids]

camelCards = list(zip(hands,bids))

typeBuckets = [[],[],[],[],[],[],[]]

for camelCard in camelCards:
	hand = camelCard[0]
	typeScore = typeSort(hand)
	typeBuckets[typeScore].append(camelCard)

finalCardSort = []

for bucket in typeBuckets:
	if(len(bucket) > 1):
		bucket.sort(key=bucketSort)
	for camelCard in bucket:
		finalCardSort.append(camelCard)

camelScores = []

for camelIndex in range(len(finalCardSort)):
	scoreMultiplier = camelIndex + 1
	camelCard = finalCardSort[camelIndex]
	camelScores.append(camelCard[1] * scoreMultiplier)

print(sum(camelScores))

Part 2: https://github.com/porotoman99/Advent-of-Code-2023/blob/main/Day 7/part2.py

Code

import os

filePath = os.path.dirname(os.path.realpath(__file__))
inputFilePath = filePath + "\\adventofcode.com_2023_day_7_input.txt"
# inputFilePath = filePath + "\\part1.txt"

def typeSort(hand):
	cardCount = {
		"J": 0,
		"2": 0,
		"3": 0,
		"4": 0,
		"5": 0,
		"6": 0,
		"7": 0,
		"8": 0,
		"9": 0,
		"T": 0,
		"Q": 0,
		"K": 0,
		"A": 0
	}
	for card in hand:
		cardCount[card] += 1
	jokerCount = cardCount["J"]
	cardCount["J"] = 0
	cardTotals = list(cardCount.values())
	cardTotals.sort(reverse=True)
	if(cardTotals[0] + jokerCount == 5):
		return 6
	elif(cardTotals[0] + jokerCount == 4):
		return 5
	elif(
		cardTotals[0] + jokerCount == 3 and cardTotals[1] == 2
		or cardTotals[0] == 3 and cardTotals[1] + jokerCount == 2
	):
		return 4
	elif(cardTotals[0] + jokerCount == 3):
		return 3
	elif(
		cardTotals[0] + jokerCount == 2 and cardTotals[1] == 2
		or cardTotals[0] == 2 and cardTotals[1] + jokerCount == 2
	):
		return 2
	elif(cardTotals[0] + jokerCount == 2):
		return 1
	else:
		return 0

def bucketSort(camelCard):
	totalScore = 0
	cardOrder = ["J","2","3","4","5","6","7","8","9","T","Q","K","A"]
	hand = camelCard[0]
	totalScore += cardOrder.index(hand[4]) * 15 ** 1
	totalScore += cardOrder.index(hand[3]) * 15 ** 2
	totalScore += cardOrder.index(hand[2]) * 15 ** 3
	totalScore += cardOrder.index(hand[1]) * 15 ** 4
	totalScore += cardOrder.index(hand[0]) * 15 ** 5
	return totalScore

hands = []
bids = []

with open(inputFilePath) as inputFile:
	for line in inputFile:
		lineSplit = line.split()
		hand = lineSplit[0]
		bid = lineSplit[1]
		hands.append(hand)
		bids.append(bid)

bids = [int(bid) for bid in bids]

camelCards = list(zip(hands,bids))

typeBuckets = [[],[],[],[],[],[],[]]

for camelCard in camelCards:
	hand = camelCard[0]
	typeScore = typeSort(hand)
	typeBuckets[typeScore].append(camelCard)

finalCardSort = []

for bucket in typeBuckets:
	if(len(bucket) > 1):
		bucket.sort(key=bucketSort)
	for camelCard in bucket:
		finalCardSort.append(camelCard)

camelScores = []

for camelIndex in range(len(finalCardSort)):
	scoreMultiplier = camelIndex + 1
	camelCard = finalCardSort[camelIndex]
	camelScores.append(camelCard[1] * scoreMultiplier)

print(sum(camelScores))

I tried to do this one as quickly as possible, so the code is more messy than I would prefer, but it works, and I don’t think the solution is too bad overall.

Edit: I went back and changed it to be a bit better. Here are my new solutions:

Part 1 v2: https://github.com/porotoman99/Advent-of-Code-2023/blob/main/Day 7/part1v2.py

Code

import os

filePath = os.path.dirname(os.path.realpath(__file__))
inputFilePath = filePath + "\\adventofcode.com_2023_day_7_input.txt"
# inputFilePath = filePath + "\\part1.txt"

CARD_ORDER = "23456789TJQKA"

def typeSort(camelCard):
	cardCount = {}
	for card in CARD_ORDER:
		cardCount[card] = 0
	hand = camelCard[0]
	for card in hand:
		cardCount[card] += 1
	cardTotals = list(cardCount.values())
	cardTotals.sort(reverse=True)
	if(cardTotals[0] == 5):
		return 6
	elif(cardTotals[0] == 4):
		return 5
	elif(cardTotals[0] == 3 and cardTotals[1] == 2):
		return 4
	elif(cardTotals[0] == 3):
		return 3
	elif(cardTotals[0] == 2 and cardTotals[1] == 2):
		return 2
	elif(cardTotals[0] == 2):
		return 1
	else:
		return 0

def handSort(camelCard):
	totalScore = 0
	hand = camelCard[0]
	totalScore += CARD_ORDER.index(hand[4]) * 15 ** 1
	totalScore += CARD_ORDER.index(hand[3]) * 15 ** 2
	totalScore += CARD_ORDER.index(hand[2]) * 15 ** 3
	totalScore += CARD_ORDER.index(hand[1]) * 15 ** 4
	totalScore += CARD_ORDER.index(hand[0]) * 15 ** 5
	return totalScore

hands = []
bids = []

with open(inputFilePath) as inputFile:
	for line in inputFile:
		lineSplit = line.split()
		hand = lineSplit[0]
		bid = lineSplit[1]
		hands.append(hand)
		bids.append(int(bid))

camelCards = list(zip(hands,bids))
camelCards = sorted(camelCards, key=lambda x: (typeSort(x), handSort(x)))

camelScores = []

for camelIndex in range(len(camelCards)):
	scoreMultiplier = camelIndex + 1
	camelCard = camelCards[camelIndex]
	camelScores.append(camelCard[1] * scoreMultiplier)

print(sum(camelScores))

Part 2 v2: https://github.com/porotoman99/Advent-of-Code-2023/blob/main/Day 7/part2v2.py

Code

import os

filePath = os.path.dirname(os.path.realpath(__file__))
inputFilePath = filePath + "\\adventofcode.com_2023_day_7_input.txt"
# inputFilePath = filePath + "\\part1.txt"

CARD_ORDER = "J23456789TQKA"

def typeSort(camelCard):
	cardCount = {}
	for card in CARD_ORDER:
		cardCount[card] = 0
	hand = camelCard[0]
	for card in hand:
		cardCount[card] += 1
	jokerCount = cardCount["J"]
	cardCount["J"] = 0
	cardTotals = list(cardCount.values())
	cardTotals.sort(reverse=True)
	if(cardTotals[0] + jokerCount == 5):
		return 6
	elif(cardTotals[0] + jokerCount == 4):
		return 5
	elif(
		cardTotals[0] + jokerCount == 3 and cardTotals[1] == 2
		or cardTotals[0] == 3 and cardTotals[1] + jokerCount == 2
	):
		return 4
	elif(cardTotals[0] + jokerCount == 3):
		return 3
	elif(
		cardTotals[0] + jokerCount == 2 and cardTotals[1] == 2
		or cardTotals[0] == 2 and cardTotals[1] + jokerCount == 2
	):
		return 2
	elif(cardTotals[0] + jokerCount == 2):
		return 1
	else:
		return 0

def handSort(camelCard):
	totalScore = 0
	hand = camelCard[0]
	totalScore += CARD_ORDER.index(hand[4]) * 15 ** 1
	totalScore += CARD_ORDER.index(hand[3]) * 15 ** 2
	totalScore += CARD_ORDER.index(hand[2]) * 15 ** 3
	totalScore += CARD_ORDER.index(hand[1]) * 15 ** 4
	totalScore += CARD_ORDER.index(hand[0]) * 15 ** 5
	return totalScore

hands = []
bids = []

with open(inputFilePath) as inputFile:
	for line in inputFile:
		lineSplit = line.split()
		hand = lineSplit[0]
		bid = lineSplit[1]
		hands.append(hand)
		bids.append(int(bid))

camelCards = list(zip(hands,bids))
camelCards = sorted(camelCards, key=lambda x: (typeSort(x), handSort(x)))

camelScores = []

for camelIndex in range(len(camelCards)):
	scoreMultiplier = camelIndex + 1
	camelCard = camelCards[camelIndex]
	camelScores.append(camelCard[1] * scoreMultiplier)

print(sum(camelScores))