Walking Image

Why are you selling this site? No time to manage

How is it monetized? Not planned yet

Does this site come with any social media accounts? No

How much time does this site take to run? Its all running on wordpress

What challenges are there with running this site? No Challenge.

3D Collisions – Walking below a slope pushes me through the floor

Here’s a really short video (less than 30s) of this issue : https://www.youtube.com/watch?v=JrKbpTY8cMU

When I move the player towards a slope (the player is below it), it pushes the player inside the floor Collider instead of blocking it.

I’ve searched the Internet for a while but haven’t found anything about it

Do you have something in mind ?
Thanks for your time

Info : I move the player using rigidbody.MovePosition()

The collision of the player is a Capsule.

Differences Between “Walking Arsenal (Gear)” and “Walking Arsenal (Inventor)”?

So, I’ve been trying to make a technical character; a super-inventor if you will. And I can’t seem to understand what the benefit of either Ability is.

If you have Walking Arsenal, linked to either Gear or Inventor, what would the difference be? Is there any benefit or detriment of either?

Walking a graph without recursion

I’m working on a class that receives a relational EDM/data model (e.g. a SQL DB or OData API manifest) and performs a couple tasks on them (not necessarily at the same time, could be two separate runs). The class/alg doesn’t know anything when it starts, finds everything from the schema data, but the schema doc is static so could be re-processed. What I call “sets” are tables, REST API endpoints, etc., i.e. publicly/user-accessible entry points to the data. One of the things I output is a “path” to each type (e.g. A is a set, so just “A”; B is not a set but is a child of A, so “A→B”). Another is whether anything changes between two models (true/false equality of the model pair).

Unfortunately, the input isn’t necessarily “correct”–some related child types are not available on their own (only through parents), some are missing relations (no ID fields) so I infer based on existence of the property, some have relation loops (A → B → C → A). Some have child collections (1:N) with no mapping type, so I infer that based on the relation prop and invent a mapping type.

Anywho, my current solution uses depth-first and recursion and keeps track of the types it has seen to prevent overflow and false negatives. We’ve found some wacky corner cases (in addition to the above; such as a type set existing, but the type definition itself isn’t in the schema). What I have written works, for what we’ve tested/seen so far, but I am curious if there are other methods by which this sort of traversal or processing might be done, hopefully that could be implemented more simply than what I have now, which gets increasingly ugly and seems more fragile as more weird cases come up.

Generally, what I do now, single-threaded, is: get the list of sets, find outliers that don’t exist in the opposing model, then for each set common between the two models get the type of that set, call CompareType(t1, t2). This will compare properties on those types between the two models and then descend into each related type. If a child has been seen before or is itself a set, I assume it’s OK (skip/return true) because it gets checked on its own.

This is in C# though I’m not sure that is very important as far as the general design of the algorithm. I was curious if there is a better way to do it, e.g. some sort of token walking like I’ve seen in JSON parsers, or a FSM-like solution, or something like that.

Manually walking through the signature generation of a certificate

Based on this very enlightening question and answer, I’m interested in how to generate the signature of an x509 certificate manually, assuming I do have the private key.

Let’s create a self-signed certificate named scrt with matching private key skey as an exercise. I’d expect this to work:

#!/bin/bash  # extract TBS certificate openssl asn1parse -in scrt -strparse 4 -noout -out tbs # create signature of TBS certificate cat tbs | openssl sha256 -sign skey -out sig # create hash of TBS certificate cat tbs | openssl sha256 -binary -out hash # check if the signature of the hash is valid openssl pkeyutl -verify -in hash -sigfile sig -inkey scrt -certin 

However, it tells me: “Signature Verification Failure”

What am I doing wrong?

Is there a functional difference between having a listed climb speed and being able to climb at full walking speed?

The normal rules for climbing state that:

Each foot of movement costs 1 extra foot (2 extra feet in difficult terrain) when you’re climbing, swimming, or crawling. You ignore this extra cost if you have a climbing speed and use it to climb, or a swimming speed and use it to swim. At the DM’s option, climbing a slippery vertical surface or one with few handholds requires a successful Strength (Athletics) check. Similarly, gaining any distance in rough water might require a successful Strength (Athletics) check.

(noting that the basic rules version of the same neglects to clarify that you actually have to be using your climbing speed to benefit, and accidentally suggests that your listed climbing speed is irrelevant if your walking speed is faster)

The Thief rogue archetype has the ability Second-Story Work which provides the following benefit:

When you choose this archetype at 3rd level, you gain the ability to climb faster than normal; climbing no longer costs you extra movement.

The Athlete feat, as one of its benefits, offers the same effect:

Climbing doesn’t cost you extra movement.

As far as I can tell, a 3rd level Thief or an Athlete functionally has a climbing speed equal to their normal walking speed, but they definitely don’t actually have a climbing speed. Unlike in previous editions, having a climbing speed doesn’t seem to offer any side benefits, such as a bonus to skill/ability checks made to climb in difficult circumstances.

Is there any mechanical difference between having an actual climbing speed equal to walking speed or having the ability to climb with your walking speed without penalty? Are there any other abilities or effects a character might be subject to where the distinction is meaningful?

maximal number of time slots until a successful transmission in adaptive tree walking protocol

i have a problem understanding some vital points in adaptive tree walking protocol:

for simplicity sake, only two stations want to broadcast in the given network: A and C.

what is the maximal number of time slots until and including a successful transmission occurs?

what i think: in bit slots, first both stations want to broadcast, so there’s a collision at 1. same occurs when traversing to 2. now we traverse to 2, and A is transmitted, afterwards C is transmitted.

if the probability of a successful transmission is p, then let’s mark that a successful broadcast in station A occurs at probability p and a successful broadcast in station C occurs at probability 1-p. if they both want to transmit all the time and there are constant collisions, then the aforementioned traversal will occur and 5 bit slots will be used. but i don’t understand how can i use it to calculate the maximal amount of time slots until a successful transmission.

would really appreciate your assistance with it

Walking: counting steps when walking back and forth in a circle

I am aware of the fact that Android devices can count the number of steps taken by a person as they walk. However, I am uncertain as to how they do this. Do they rely solely on GPS? If so, if someone keeps on walking in a circle so that their position does not change much and stays within a few meters, then is the device successful at reporting number of steps walked? If not, what other data do they use and how do they carry out the computation at the device level and how does the computation work?