“As a black woman, my politics and political affiliation are bound up with and flow from participation in my people’s struggle for liberation, and with the fight of oppressed people all over the world against American imperialism.”

– Angela Davis

Angela Davis, activist, educator, and scholar, was born on January 26, 1944, in the “Dynamite Hill” area of Birmingham, Alabama. The area received that name because so many African American homes in this middle class neighborhood had been bombed over the years by the Ku Klux Klan.

Her father, Frank Davis, was a service station owner and her mother, Sallye Davis, was an elementary school teacher. Davis’s mother was also active in the National Association for the Advancement of Colored People (NAACP), when it was dangerous to be openly associated with the organization because of its civil rights activities.

As a teenager Davis moved to New York City with her mother, who was pursuing a master’s degree at New York University.

In 1961 Davis enrolled in Brandeis University in Waltham, Massachusetts. While at Brandeis, Davis also studied abroad for a year in France and returned to the U.S. to complete her studies, joining Phi Beta Kappa and earning her B.A. (magna cum laude) in 1965. Even before her graduation, Davis, so moved by the deaths of the four girls killed in the bombing of Sixteenth Street Baptist Church in her hometown in 1963, that she decided to join the civil rights movement.

By 1967, however, Davis was influenced by Black Power advocates and joined the SNCC and then the Black Panther Party. She also continued her education, earning an M.A. from the University of California at San Diego in 1968. Davis moved further to the left in the same year when she became a member of the Communist Party USA.

In 1969, Angela Davis was hired by the University of California at Los Angeles (UCLA) as an assistant professor of philosophy, but her involvement in the Communist Party led to her dismissal. During the early 1970s, she also became active in the movement to improve prison conditions for inmates. That work led to her campaign to release the “Soledad (Prison) Brothers.” The Soledad Brothers were two African American prisoners and Black Panther Party members, George Jackson and W. L. Nolen, who were incarcerated in the late 1960s.

On August 7, 1970, Jonathan Jackson, the younger brother of George Jackson, attempted to free prisoners who were on trial in the Marin County Courthouse. During this failed attempt, Superior Court Judge Harold Haley and three others, including Jonathan Jackson, were killed. Although Davis did not participate in the actual break-out attempt, she became a suspect when it was discovered that the guns used by Jackson were registered in her name. Davis fled to avoid arrest and was placed on the FBI’s most wanted list. Law enforcement captured her several months later in New York. During her high profile trial in 1972, Davis was acquitted on all charges.

Angela Davis has been an activist and writer promoting women’s rights and racial justice while pursuing her career as a philosopher and teacher at the University of Santa Cruz and San Francisco University. She achieved tenure at the University of California at Santa Cruz despite the fact that former Governor Ronald Reagan swore she would never teach again in the University of California system.

In the political arena, Davis ran unsuccessfully in 1980 and 1984 on the Communist Party ticket for vice president of the United States. Despite her 2018 retirement, Davis continues to be an activist and lecturer as Professor Emeritus of History of Consciousness and Feminist Studies at the University of California at Santa Cruz.

An author of eight books, a persistent theme of her work has been the range of social problems associated with incarceration and the generalized criminalization of those communities that are most affected by poverty and racial discrimination.

“I think the importance of doing activist work is precisely because it allows you to give back and to consider yourself not as a single individual who may have achieved whatever but to be a part of an ongoing historical movement.”

– Angela Davis

Megathreads and spaces to hang out:

reminders:

  • 💚 You nerds can join specific comms to see posts about all sorts of topics
  • 💙 Hexbear’s algorithm prioritizes comments over upbears
  • 💜 Sorting by new you nerd
  • 🐶 Join the unofficial Hexbear-adjacent Mastodon instance toots.matapacos.dog

Links To Resources (Aid and Theory):

Aid:

Theory:

Financial Support to the Bearsite

  • Carl [he/him]@hexbear.netEnglish
    5·
    1 day ago

    Back to working on Pykrieg today, big update coming up as I’m working on the first computer opponent! Right now my only goal is to have something that a) advances towards the opponent arsenal and b) maintains its lines of communication at least semi effectively, but this has proven a much more difficult task than I thought it would be.

    Right now the way it works is I get a list of all legal moves from the engine and evaluate them based on predefined criteria, give scores to each move based on how well or poorly it is evaluated, and then choose randomly from the top moves according to the scoring system. The result so far is pretty bad, but I’m not worried about the computer’s strength yet, just making something that works. The current canonical computer implementation of this game also has really bad AI, so I remain optimistic that I can make something better given time.

    It is very interesting watching the behavior change wildly as I make small adjustments to the move scoring parameters, +50 “maintain adjacency” causes all of the movement to become uselessly conservative as the AI refuses to march across the map, +25 “advance towards enemy arsenal” causes the AI to throw all caution to the wind in a mad dash towards the opponent’s command structure, outrunning its lines of communication in the process. A common failure mode I keep running into is that the AI loses contact with its combat units and then charges in with its relays instead of reestablishing communication.

    I’ve even seen some cool emergent behaviors! There’s an “interpose defensively” modifier that spots when an arsenal is threatened and tries to move a unit to protect it, and I’ve seen the North player preposition infantry in a mountain pass defending their arsenal and keep them there all game, effectively reacting to the South player threatening to attack through it and blocking off the possibility. But most games between two AI opponents currently end in either a stalemate or with one of the AIs accidentally checkmating itself.

    In general my AI seems to handle the “South” player much better than it does the “North” player, primarily because the North player can’t figure out how to get its units around the South player’s mountains, while the South player has a straight shot through the North player’s mountain pass… eventually. Every game that ends takes 200 moves or more, which is not at all how long this game takes with human players.

    I’ve been thinking I might learn how to do a machine learning thing to optimize the values, but I have no idea where to start with that. I wrote a pytest that has two AI opponents play a headless game against each other at processor speed, which is probably step one, and I guess I should make a list of values to test and have them play against each other hundreds of times while recording the results to see which values make for the strongest opponent. So I guess I do know where to start after all.