Tag: certain

Why do game engines define the a certain way to do things and not allow a lot of flexibility?

I understand that game engines have their own level design methods and different implementations of levels but why don’t they allow full control of the level design to the game developer? Without actually stating that, "The game developer should do/ use this to get this." rather than "Use these tools to get this done. Have full control over your product." ideology?

I guess its because not all game developers are interested in dealing with low level aspects of the game development phase but wouldn’t it be more efficient if the user can optimize certain aspects of the game to better suit for their product? For example, a mesh object, resource submissions, or other areas which game engines define a certain method?

How to identify why two-factor code SMS messages are never received from certain websites

I have accounts with three financial websites which only offer two-factor authentication codes to be sent via text message or phone call, but when I request codes via text message, the messages are never received. When I choose the phone call option, however, I do receive the call.

Some notes:

  • Requesting codes multiple times does not solve the issue – I never receive any texts.

  • I’ve verified that I have not blocked any phone numbers, either on my phone’s local settings or within my account with my cellular carrier.

  • I can receive codes from all other websites on which I use two-factor authentication and receive codes via text message. This only happens with these three websites. Also, there is no relation between these three sites – they are all for completely separate financial institutions.

  • Reaching out to the customer service/technical support departments of these three websites has not produced any helpful information or solutions.

  • I’ve had this phone number for over 15 years so I’m wondering if at some point my number has inadvertently ended up on an SMS blocked list that these three websites subscribe to.

I want to be able to figure out why this happens and make it so I can receive texts, so that in the event that the phone call option is removed or temporarily unavailable for any of these sites, or I start using a new site which also has this issue but does not offer the phone call option, I won’t lose access to my accounts.

Are there SMS block lists that text messaging services subscribe to? If so, is there a way for someone to find out if their number is blocked? If not, would there be any way to troubleshoot this problem?

i want to count the number of occurrences of certain values of my TagName column

i want to count the number of occurrences of different sensor rows in SQL, but i seem to be doing it wrong and seemingly i am not visualizing it correctly.

if i was doing this in pseudocode in a c style language i would do it like this:

FOR i in range(taglist[i]):          print(taglist[i], count(taglist[i]) )

i have been trying this:

Select Count(a) FROM (     SELECT Distinct [TagName]          FROM [A2ALMDB].[dbo].[AlarmMaster]         where (TagName like '%Sensor%' or GroupName like'%Sensors%')     ) a

it returns ’66’, but i want it to return the count of each of the distinct tagnames that are returned in Select A.

Can anyone help me with how i should be trying to get all the counts of my different sensor occurrences to total instead of a count of all the distinct tagnames?

thanks for the help!

Why does Mathematica crash at a certain recursion depth?

If I enter

Block[{$  RecursionLimit = 70000}, x = x + 1]

I get

$  RecursionLimit: Recursion depth of 70000 exceeded during evaluation of 1+x.

But at $ RecursionLimit = 80000, Mathematica crashes (i.e. goes unresponsive for a little while and then clears all variables). Why is this? Is there some limiting factor that I can increase to go even further?

NMinimize: How to avoid solutions that do not satisfy constraints within a certain tolerance?

I just started to use Mathematica a few weeks ago. Using NMinimze, I would like to avoid solutions that do not satisfy certain constraints (although they "almost" satisfy them). Do you know how to change the following command to find a solution satisfying "completely" all the constraints, solving the same minimization problem?

NMinimize[{((e*(1 - Sqrt[(g - e)^2 + (f - h)^2]) + (g - e)*(1 -        Sqrt[f^2 + e^2])) + (h*(1 -        Sqrt[(g - e)^2 + (f - h)^2]) + (f - h)*(1 -        Sqrt[g^2 + h^2])))/((g + f)*  Max[1 - Sqrt[(g - e)^2 + (f - h)^2], 1 - Sqrt[g^2 + h^2]]), 0 <= e <= 1, 0 <= f <= 1, e^2 + f^2 == 1, e <= g <= 1, 0 <= h <= f, Sqrt[(g - e)^2 + (f - h)^2] <= 1, g^2 + h^2 <= 1}, {e, f, g, h}]

What target numbers would be a certain level of difficulty under this system?

I’m writing a homebrew game system, and I found that I have an action resolution mechanic but not a good system for target numbers (I call them Success Thresholds, or STs, in this game, and from now on I’ll use that term to refer to the minimum number a player gets that can succeed).

To resolve an action, most of the time players roll 2d6 and add a modifier ranging from +0 to +3, depending on the stat. With Advantage, it is (3d6 drop lowest)+mod, and Disadvantage is (3d6 drop highest)+mod.

There are also 4 (well, 5, but one auto succeeds) levels of difficulty. The Trivial tasks are automatically successful. Easy tasks should succeed about 75-80 percent of the time, Moderate tasks should be successful 50-60% of the time, Hard tasks should be successful between 25 and 40 percent of the time, and impossible tasks shouldn’t succeed more than 25% and often more like succeeding below 10-15% or the time even with Advantage and a +3 mod.

This is an anydice program with the base probabilities for a +0 mod. I want to know what number should the ST be for each level of difficulty? I had initially considered 7 as a base difficulty for Moderate tasks, before I added modifiers to rolls.